/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_w64_d32_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:19:19,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:19:19,138 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:19,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:19:19,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:19:19,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:19:19,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:19:19,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:19:19,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:19:19,156 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:19:19,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:19:19,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:19:19,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:19:19,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:19:19,157 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:19:19,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:19:19,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:19:19,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:19:19,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:19:19,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:19:19,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:19:19,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:19:19,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:19:19,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:19:19,169 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:19:19,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:19:19,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:19:19,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:19:19,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:19:19,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:19,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:19:19,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:19:19,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:19:19,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:19:19,172 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:19,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:19:19,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:19:19,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:19:19,359 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:19:19,360 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:19:19,361 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_w64_d32_e0.c [2023-12-16 19:19:20,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:19:20,678 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:19:20,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2023-12-16 19:19:20,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53e590be/918c3a0aba0348e385c5c4b32703fa2c/FLAG2eabd6619 [2023-12-16 19:19:20,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53e590be/918c3a0aba0348e385c5c4b32703fa2c [2023-12-16 19:19:20,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:19:20,706 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:19:20,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:19:20,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:19:20,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:19:20,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:20" (1/1) ... [2023-12-16 19:19:20,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eef8edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:20, skipping insertion in model container [2023-12-16 19:19:20,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:20" (1/1) ... [2023-12-16 19:19:20,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:19:20,875 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_w64_d32_e0.c[1280,1293] [2023-12-16 19:19:21,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:19:21,074 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:19:21,082 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_w64_d32_e0.c[1280,1293] [2023-12-16 19:19:21,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:19:21,177 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:19:21,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:21 WrapperNode [2023-12-16 19:19:21,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:19:21,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:21,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:19:21,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:19:21,184 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:21" (1/1) ... [2023-12-16 19:19:21,237 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:21" (1/1) ... [2023-12-16 19:19:21,418 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3483 [2023-12-16 19:19:21,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:21,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:19:21,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:19:21,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:19:21,427 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:21" (1/1) ... [2023-12-16 19:19:21,428 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:21" (1/1) ... [2023-12-16 19:19:21,466 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:21" (1/1) ... [2023-12-16 19:19:21,533 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:21,534 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:21" (1/1) ... [2023-12-16 19:19:21,534 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:21" (1/1) ... [2023-12-16 19:19:21,599 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:21" (1/1) ... [2023-12-16 19:19:21,627 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:21" (1/1) ... [2023-12-16 19:19:21,664 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:21" (1/1) ... [2023-12-16 19:19:21,692 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:21" (1/1) ... [2023-12-16 19:19:21,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:19:21,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:19:21,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:19:21,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:19:21,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:21" (1/1) ... [2023-12-16 19:19:21,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:21,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:19:21,770 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:21,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:19:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 19:19:21,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 19:19:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:19:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:19:21,796 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:21,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:19:22,258 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:19:22,260 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:19:23,759 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:19:23,805 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:19:23,805 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:19:23,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:23 BoogieIcfgContainer [2023-12-16 19:19:23,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:19:23,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:19:23,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:19:23,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:19:23,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:19:20" (1/3) ... [2023-12-16 19:19:23,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711622be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:23, skipping insertion in model container [2023-12-16 19:19:23,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:21" (2/3) ... [2023-12-16 19:19:23,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711622be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:23, skipping insertion in model container [2023-12-16 19:19:23,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:23" (3/3) ... [2023-12-16 19:19:23,811 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2023-12-16 19:19:23,822 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:19:23,822 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:19:23,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:19:23,863 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;@39a8ad50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:19:23,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:19:23,868 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:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-16 19:19:23,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:23,880 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:23,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:23,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1087534194, now seen corresponding path program 1 times [2023-12-16 19:19:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:23,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800164084] [2023-12-16 19:19:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,297 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,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800164084] [2023-12-16 19:19:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800164084] 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 [2] imperfect sequences [] total 2 [2023-12-16 19:19:24,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620069794] [2023-12-16 19:19:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:24,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 19:19:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 19:19:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:19:24,335 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:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:24,410 INFO L93 Difference]: Finished difference Result 1188 states and 1972 transitions. [2023-12-16 19:19:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 19:19:24,412 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:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:24,427 INFO L225 Difference]: With dead ends: 1188 [2023-12-16 19:19:24,427 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:24,434 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:24,437 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:24,438 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:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:24,494 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:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1083 transitions. [2023-12-16 19:19:24,497 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1083 transitions. Word has length 212 [2023-12-16 19:19:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:24,498 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1083 transitions. [2023-12-16 19:19:24,498 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:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1083 transitions. [2023-12-16 19:19:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-16 19:19:24,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:24,501 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:24,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:19:24,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:24,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -127458616, now seen corresponding path program 1 times [2023-12-16 19:19:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673192742] [2023-12-16 19:19:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:24,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,522 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,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673192742] [2023-12-16 19:19:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673192742] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523322925] [2023-12-16 19:19:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:25,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:25,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:25,530 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:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:25,619 INFO L93 Difference]: Finished difference Result 1186 states and 1960 transitions. [2023-12-16 19:19:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:25,619 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:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:25,624 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:25,624 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:25,626 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,627 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 946 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2098 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:25,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2098 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:25,639 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:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1082 transitions. [2023-12-16 19:19:25,641 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1082 transitions. Word has length 212 [2023-12-16 19:19:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:25,642 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1082 transitions. [2023-12-16 19:19:25,643 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:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1082 transitions. [2023-12-16 19:19:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-16 19:19:25,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:25,651 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:25,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:19:25,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:25,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:25,653 INFO L85 PathProgramCache]: Analyzing trace with hash -590962848, now seen corresponding path program 1 times [2023-12-16 19:19:25,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:25,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579131853] [2023-12-16 19:19:25,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,042 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,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579131853] [2023-12-16 19:19:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579131853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431545290] [2023-12-16 19:19:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:26,045 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:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:26,175 INFO L93 Difference]: Finished difference Result 1186 states and 1958 transitions. [2023-12-16 19:19:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:26,176 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:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:26,178 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:26,178 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:26,179 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:26,180 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 2011 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:26,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2014 Valid, 2098 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:26,188 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:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1081 transitions. [2023-12-16 19:19:26,190 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1081 transitions. Word has length 213 [2023-12-16 19:19:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:26,190 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1081 transitions. [2023-12-16 19:19:26,191 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:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1081 transitions. [2023-12-16 19:19:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-16 19:19:26,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:26,192 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:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:19:26,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:26,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1916029474, now seen corresponding path program 1 times [2023-12-16 19:19:26,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:26,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415584512] [2023-12-16 19:19:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:26,273 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,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,584 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,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415584512] [2023-12-16 19:19:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415584512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:26,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649979229] [2023-12-16 19:19:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:26,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:26,587 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:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:26,674 INFO L93 Difference]: Finished difference Result 1186 states and 1956 transitions. [2023-12-16 19:19:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:26,675 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:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:26,677 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:26,677 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:26,679 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:26,684 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 2003 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 2098 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:26,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 2098 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:26,695 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:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1080 transitions. [2023-12-16 19:19:26,697 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1080 transitions. Word has length 214 [2023-12-16 19:19:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:26,699 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1080 transitions. [2023-12-16 19:19:26,699 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:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1080 transitions. [2023-12-16 19:19:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-16 19:19:26,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:26,701 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:26,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:19:26,701 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:26,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1886987654, now seen corresponding path program 1 times [2023-12-16 19:19:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793674697] [2023-12-16 19:19:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,091 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,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793674697] [2023-12-16 19:19:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793674697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:27,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759885901] [2023-12-16 19:19:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:27,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:27,094 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:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:27,182 INFO L93 Difference]: Finished difference Result 1186 states and 1954 transitions. [2023-12-16 19:19:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:27,183 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:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:27,185 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:27,185 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:27,186 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:27,186 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 1995 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 2098 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:27,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 2098 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:27,196 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:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1079 transitions. [2023-12-16 19:19:27,197 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1079 transitions. Word has length 215 [2023-12-16 19:19:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:27,198 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1079 transitions. [2023-12-16 19:19:27,198 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:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1079 transitions. [2023-12-16 19:19:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-16 19:19:27,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:27,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, 1, 1] [2023-12-16 19:19:27,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:19:27,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:27,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1220552316, now seen corresponding path program 1 times [2023-12-16 19:19:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:27,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448525356] [2023-12-16 19:19:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:27,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:27,858 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 104 [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 116 [2023-12-16 19:19:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,868 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,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448525356] [2023-12-16 19:19:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448525356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:27,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:27,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068108643] [2023-12-16 19:19:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:27,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:27,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:27,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:27,870 INFO L87 Difference]: Start difference. First operand 655 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 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:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:28,084 INFO L93 Difference]: Finished difference Result 1186 states and 1952 transitions. [2023-12-16 19:19:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 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:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:28,087 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:28,087 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:28,087 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:28,088 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 890 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1898 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:28,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1898 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:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:28,099 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:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1078 transitions. [2023-12-16 19:19:28,100 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1078 transitions. Word has length 216 [2023-12-16 19:19:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:28,101 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1078 transitions. [2023-12-16 19:19:28,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 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:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1078 transitions. [2023-12-16 19:19:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-16 19:19:28,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:28,102 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:28,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:19:28,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:28,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 30776476, now seen corresponding path program 1 times [2023-12-16 19:19:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773462771] [2023-12-16 19:19:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,551 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,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:28,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773462771] [2023-12-16 19:19:28,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773462771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:28,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:28,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195702297] [2023-12-16 19:19:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:28,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:28,553 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:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:28,744 INFO L93 Difference]: Finished difference Result 1210 states and 1985 transitions. [2023-12-16 19:19:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:28,745 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:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:28,747 INFO L225 Difference]: With dead ends: 1210 [2023-12-16 19:19:28,747 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:28,748 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:28,749 INFO L413 NwaCegarLoop]: 1060 mSDtfsCounter, 938 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:28,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 3073 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:28,758 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:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1077 transitions. [2023-12-16 19:19:28,762 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1077 transitions. Word has length 217 [2023-12-16 19:19:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:28,762 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1077 transitions. [2023-12-16 19:19:28,762 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:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1077 transitions. [2023-12-16 19:19:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-16 19:19:28,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:28,764 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:28,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:19:28,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:28,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:28,764 INFO L85 PathProgramCache]: Analyzing trace with hash -544432972, now seen corresponding path program 1 times [2023-12-16 19:19:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667454869] [2023-12-16 19:19:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,130 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,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:29,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667454869] [2023-12-16 19:19:29,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667454869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:29,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023355011] [2023-12-16 19:19:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:29,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:29,132 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:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:29,346 INFO L93 Difference]: Finished difference Result 1186 states and 1948 transitions. [2023-12-16 19:19:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:29,347 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:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:29,351 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:29,352 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:29,352 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:29,353 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1973 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 1898 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:29,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 1898 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:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:29,363 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:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1076 transitions. [2023-12-16 19:19:29,364 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1076 transitions. Word has length 218 [2023-12-16 19:19:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:29,364 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1076 transitions. [2023-12-16 19:19:29,365 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:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1076 transitions. [2023-12-16 19:19:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-16 19:19:29,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:29,367 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:29,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:19:29,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:29,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1409455998, now seen corresponding path program 1 times [2023-12-16 19:19:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143533819] [2023-12-16 19:19:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,824 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,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143533819] [2023-12-16 19:19:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143533819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616169506] [2023-12-16 19:19:29,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:29,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:29,826 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:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:30,052 INFO L93 Difference]: Finished difference Result 1186 states and 1946 transitions. [2023-12-16 19:19:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:30,052 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:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:30,055 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:30,055 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:30,055 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:30,056 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1063 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1904 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:30,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1904 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:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:30,066 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:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1075 transitions. [2023-12-16 19:19:30,068 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1075 transitions. Word has length 219 [2023-12-16 19:19:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:30,068 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1075 transitions. [2023-12-16 19:19:30,069 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:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1075 transitions. [2023-12-16 19:19:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-16 19:19:30,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:30,070 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:30,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:19:30,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:30,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 838263002, now seen corresponding path program 1 times [2023-12-16 19:19:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293904223] [2023-12-16 19:19:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,504 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,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:30,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293904223] [2023-12-16 19:19:30,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293904223] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:30,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:30,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208689966] [2023-12-16 19:19:30,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:30,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:30,507 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:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:30,722 INFO L93 Difference]: Finished difference Result 1186 states and 1944 transitions. [2023-12-16 19:19:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:30,723 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:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:30,725 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:30,725 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:30,727 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:30,728 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1059 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1904 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:30,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1904 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:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:30,739 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:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1074 transitions. [2023-12-16 19:19:30,741 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1074 transitions. Word has length 220 [2023-12-16 19:19:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:30,742 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1074 transitions. [2023-12-16 19:19:30,742 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:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1074 transitions. [2023-12-16 19:19:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-16 19:19:30,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:30,744 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:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:19:30,744 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:30,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 702062440, now seen corresponding path program 1 times [2023-12-16 19:19:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132424592] [2023-12-16 19:19:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:30,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,156 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132424592] [2023-12-16 19:19:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132424592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839910747] [2023-12-16 19:19:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:31,158 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:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:31,374 INFO L93 Difference]: Finished difference Result 1186 states and 1942 transitions. [2023-12-16 19:19:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:31,375 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:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:31,377 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:31,377 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:31,378 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:31,379 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1949 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 1898 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:31,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 1898 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:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:31,390 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:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1073 transitions. [2023-12-16 19:19:31,392 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1073 transitions. Word has length 221 [2023-12-16 19:19:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:31,393 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1073 transitions. [2023-12-16 19:19:31,393 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:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1073 transitions. [2023-12-16 19:19:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-16 19:19:31,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:31,395 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:31,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:19:31,395 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:31,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 27303936, now seen corresponding path program 1 times [2023-12-16 19:19:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687472311] [2023-12-16 19:19:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,792 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,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687472311] [2023-12-16 19:19:31,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687472311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:31,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418551777] [2023-12-16 19:19:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:31,794 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:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,000 INFO L93 Difference]: Finished difference Result 1186 states and 1940 transitions. [2023-12-16 19:19:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,000 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:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,002 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:32,002 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:32,003 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:32,003 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1941 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 1898 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:32,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 1898 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:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:32,012 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:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1072 transitions. [2023-12-16 19:19:32,013 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1072 transitions. Word has length 222 [2023-12-16 19:19:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,014 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1072 transitions. [2023-12-16 19:19:32,014 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:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1072 transitions. [2023-12-16 19:19:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-16 19:19:32,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,015 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:32,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:19:32,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2089992526, now seen corresponding path program 1 times [2023-12-16 19:19:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352110865] [2023-12-16 19:19:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,416 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,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352110865] [2023-12-16 19:19:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352110865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975875111] [2023-12-16 19:19:32,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:32,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:32,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:32,418 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:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,612 INFO L93 Difference]: Finished difference Result 1186 states and 1938 transitions. [2023-12-16 19:19:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,612 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:32,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,614 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:32,614 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:32,615 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:32,616 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1047 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1904 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:32,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1904 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:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:32,625 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:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1071 transitions. [2023-12-16 19:19:32,626 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1071 transitions. Word has length 223 [2023-12-16 19:19:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,627 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1071 transitions. [2023-12-16 19:19:32,627 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:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1071 transitions. [2023-12-16 19:19:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-16 19:19:32,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,628 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:32,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:19:32,629 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash -293512666, now seen corresponding path program 1 times [2023-12-16 19:19:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593337068] [2023-12-16 19:19:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,086 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,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593337068] [2023-12-16 19:19:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593337068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:33,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259022483] [2023-12-16 19:19:33,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:33,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:33,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:33,088 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:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:33,349 INFO L93 Difference]: Finished difference Result 1186 states and 1936 transitions. [2023-12-16 19:19:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:33,350 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:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:33,352 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:33,352 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:33,353 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:33,353 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1925 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1898 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:33,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1898 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:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:33,361 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:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1070 transitions. [2023-12-16 19:19:33,364 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1070 transitions. Word has length 224 [2023-12-16 19:19:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:33,364 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1070 transitions. [2023-12-16 19:19:33,364 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:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1070 transitions. [2023-12-16 19:19:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-12-16 19:19:33,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:33,366 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:33,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:19:33,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:33,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash -812167628, now seen corresponding path program 1 times [2023-12-16 19:19:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:33,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051282316] [2023-12-16 19:19:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:33,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,779 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,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051282316] [2023-12-16 19:19:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051282316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349433835] [2023-12-16 19:19:33,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:33,781 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:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,015 INFO L93 Difference]: Finished difference Result 1186 states and 1934 transitions. [2023-12-16 19:19:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:34,016 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:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,018 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:34,018 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:34,020 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:34,020 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1039 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1904 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:34,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1904 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:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:34,029 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:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1069 transitions. [2023-12-16 19:19:34,030 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1069 transitions. Word has length 225 [2023-12-16 19:19:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,030 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1069 transitions. [2023-12-16 19:19:34,031 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:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1069 transitions. [2023-12-16 19:19:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-16 19:19:34,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,032 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:34,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:19:34,032 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2016374964, now seen corresponding path program 1 times [2023-12-16 19:19:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048190030] [2023-12-16 19:19:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,440 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,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048190030] [2023-12-16 19:19:34,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048190030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:34,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:34,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:34,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693633847] [2023-12-16 19:19:34,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:34,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:34,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:34,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:34,443 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:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,684 INFO L93 Difference]: Finished difference Result 1186 states and 1932 transitions. [2023-12-16 19:19:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:34,685 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:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,687 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:34,687 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:34,687 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:34,688 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1035 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1904 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:34,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1904 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:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:34,706 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:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1068 transitions. [2023-12-16 19:19:34,708 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1068 transitions. Word has length 226 [2023-12-16 19:19:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,708 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1068 transitions. [2023-12-16 19:19:34,708 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:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1068 transitions. [2023-12-16 19:19:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-16 19:19:34,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,710 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:34,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:19:34,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2022819354, now seen corresponding path program 1 times [2023-12-16 19:19:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071210095] [2023-12-16 19:19:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,041 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,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071210095] [2023-12-16 19:19:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071210095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547137658] [2023-12-16 19:19:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:35,043 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:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:35,250 INFO L93 Difference]: Finished difference Result 1186 states and 1930 transitions. [2023-12-16 19:19:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:35,251 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:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:35,253 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:35,253 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:35,254 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:35,254 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1031 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1904 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:35,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1904 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:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:35,264 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:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1067 transitions. [2023-12-16 19:19:35,266 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1067 transitions. Word has length 227 [2023-12-16 19:19:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:35,266 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1067 transitions. [2023-12-16 19:19:35,266 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:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1067 transitions. [2023-12-16 19:19:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-16 19:19:35,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:35,268 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:35,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:19:35,269 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:35,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash 201703282, now seen corresponding path program 1 times [2023-12-16 19:19:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793694138] [2023-12-16 19:19:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,645 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,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793694138] [2023-12-16 19:19:35,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793694138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:35,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809237708] [2023-12-16 19:19:35,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:35,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:35,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:35,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:35,647 INFO L87 Difference]: Start difference. First operand 655 states and 1067 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 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:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:35,844 INFO L93 Difference]: Finished difference Result 1186 states and 1928 transitions. [2023-12-16 19:19:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:35,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 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:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:35,847 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:35,847 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:35,848 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:35,848 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1893 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 1898 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:35,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 1898 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:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:35,859 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:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1066 transitions. [2023-12-16 19:19:35,860 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1066 transitions. Word has length 228 [2023-12-16 19:19:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:35,860 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1066 transitions. [2023-12-16 19:19:35,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 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:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1066 transitions. [2023-12-16 19:19:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-16 19:19:35,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:35,863 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:35,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:19:35,863 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:35,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -143808256, now seen corresponding path program 1 times [2023-12-16 19:19:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461744397] [2023-12-16 19:19:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,198 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,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461744397] [2023-12-16 19:19:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461744397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743929622] [2023-12-16 19:19:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,201 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:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,389 INFO L93 Difference]: Finished difference Result 1186 states and 1926 transitions. [2023-12-16 19:19:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,390 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:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,392 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:36,392 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:36,393 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:36,393 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1879 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 1898 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:36,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 1898 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:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:36,402 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:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1065 transitions. [2023-12-16 19:19:36,403 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1065 transitions. Word has length 229 [2023-12-16 19:19:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,403 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1065 transitions. [2023-12-16 19:19:36,403 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:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1065 transitions. [2023-12-16 19:19:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-16 19:19:36,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,405 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:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 19:19:36,405 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1695163662, now seen corresponding path program 1 times [2023-12-16 19:19:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048872355] [2023-12-16 19:19:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,733 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,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048872355] [2023-12-16 19:19:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048872355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:36,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141197767] [2023-12-16 19:19:36,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,735 INFO L87 Difference]: Start difference. First operand 655 states and 1065 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 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:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,917 INFO L93 Difference]: Finished difference Result 1186 states and 1924 transitions. [2023-12-16 19:19:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 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:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,920 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:36,920 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:36,921 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:36,921 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1016 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1904 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:36,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1904 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:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:36,933 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:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1064 transitions. [2023-12-16 19:19:36,934 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1064 transitions. Word has length 230 [2023-12-16 19:19:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,935 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1064 transitions. [2023-12-16 19:19:36,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 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:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1064 transitions. [2023-12-16 19:19:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-16 19:19:36,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,937 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:36,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 19:19:36,937 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2013636122, now seen corresponding path program 1 times [2023-12-16 19:19:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296984303] [2023-12-16 19:19:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,295 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,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296984303] [2023-12-16 19:19:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296984303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781227469] [2023-12-16 19:19:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:37,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:37,297 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:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:37,483 INFO L93 Difference]: Finished difference Result 1186 states and 1922 transitions. [2023-12-16 19:19:37,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:37,484 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:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:37,486 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:37,486 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:37,487 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:37,487 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 1012 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1904 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:37,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1904 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:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:37,498 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:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1063 transitions. [2023-12-16 19:19:37,499 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1063 transitions. Word has length 231 [2023-12-16 19:19:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:37,500 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1063 transitions. [2023-12-16 19:19:37,500 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:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1063 transitions. [2023-12-16 19:19:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-16 19:19:37,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:37,502 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:37,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 19:19:37,502 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:37,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash -541659828, now seen corresponding path program 1 times [2023-12-16 19:19:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:37,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595574320] [2023-12-16 19:19:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,963 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,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595574320] [2023-12-16 19:19:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595574320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180790904] [2023-12-16 19:19:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:37,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:37,965 INFO L87 Difference]: Start difference. First operand 655 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 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:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:38,012 INFO L93 Difference]: Finished difference Result 1186 states and 1920 transitions. [2023-12-16 19:19:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:38,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 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:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:38,015 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:38,015 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:38,016 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:38,017 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 928 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2090 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:38,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 2090 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:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:38,025 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:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1062 transitions. [2023-12-16 19:19:38,027 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1062 transitions. Word has length 232 [2023-12-16 19:19:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:38,027 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1062 transitions. [2023-12-16 19:19:38,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 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:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1062 transitions. [2023-12-16 19:19:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-16 19:19:38,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:38,028 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:38,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 19:19:38,028 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:38,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash 875280650, now seen corresponding path program 1 times [2023-12-16 19:19:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080556782] [2023-12-16 19:19:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,419 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,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080556782] [2023-12-16 19:19:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080556782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:38,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:38,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:38,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065812582] [2023-12-16 19:19:38,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:38,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:38,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:38,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:38,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:38,422 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:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:38,478 INFO L93 Difference]: Finished difference Result 1188 states and 1920 transitions. [2023-12-16 19:19:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:38,479 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:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:38,481 INFO L225 Difference]: With dead ends: 1188 [2023-12-16 19:19:38,481 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:38,482 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:38,483 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 932 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 3159 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:38,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 3159 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:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:38,493 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:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1061 transitions. [2023-12-16 19:19:38,495 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1061 transitions. Word has length 233 [2023-12-16 19:19:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:38,496 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1061 transitions. [2023-12-16 19:19:38,496 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:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1061 transitions. [2023-12-16 19:19:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-16 19:19:38,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:38,497 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:38,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 19:19:38,498 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:38,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1357365210, now seen corresponding path program 1 times [2023-12-16 19:19:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469188572] [2023-12-16 19:19:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,052 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,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469188572] [2023-12-16 19:19:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469188572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:39,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675172799] [2023-12-16 19:19:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:39,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:39,055 INFO L87 Difference]: Start difference. First operand 655 states and 1061 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 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:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:39,172 INFO L93 Difference]: Finished difference Result 1186 states and 1916 transitions. [2023-12-16 19:19:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 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:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:39,175 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:39,175 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:39,176 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:39,177 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 898 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1990 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:39,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1990 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:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:39,197 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:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1060 transitions. [2023-12-16 19:19:39,199 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1060 transitions. Word has length 234 [2023-12-16 19:19:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:39,199 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1060 transitions. [2023-12-16 19:19:39,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 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:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1060 transitions. [2023-12-16 19:19:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-12-16 19:19:39,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:39,201 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:39,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 19:19:39,202 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:39,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1544130918, now seen corresponding path program 1 times [2023-12-16 19:19:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050693861] [2023-12-16 19:19:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,572 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,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050693861] [2023-12-16 19:19:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050693861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:39,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:39,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506452061] [2023-12-16 19:19:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:39,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:39,574 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:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:39,691 INFO L93 Difference]: Finished difference Result 1198 states and 1931 transitions. [2023-12-16 19:19:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:39,692 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:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:39,694 INFO L225 Difference]: With dead ends: 1198 [2023-12-16 19:19:39,694 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:39,695 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:39,695 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 922 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:39,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 3095 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:39,712 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:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1059 transitions. [2023-12-16 19:19:39,713 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1059 transitions. Word has length 235 [2023-12-16 19:19:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:39,713 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1059 transitions. [2023-12-16 19:19:39,713 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:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1059 transitions. [2023-12-16 19:19:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-12-16 19:19:39,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:39,715 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:39,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 19:19:39,715 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:39,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1191029826, now seen corresponding path program 1 times [2023-12-16 19:19:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:39,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733703519] [2023-12-16 19:19:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,085 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,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733703519] [2023-12-16 19:19:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733703519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231487441] [2023-12-16 19:19:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:40,087 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:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:40,206 INFO L93 Difference]: Finished difference Result 1186 states and 1912 transitions. [2023-12-16 19:19:40,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:40,207 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:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:40,209 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:40,209 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:40,210 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:40,210 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1951 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 1990 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:40,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 1990 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:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:40,234 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:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1058 transitions. [2023-12-16 19:19:40,235 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1058 transitions. Word has length 236 [2023-12-16 19:19:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:40,236 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1058 transitions. [2023-12-16 19:19:40,236 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:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1058 transitions. [2023-12-16 19:19:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-16 19:19:40,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:40,237 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:40,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 19:19:40,237 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:40,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1820827084, now seen corresponding path program 1 times [2023-12-16 19:19:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590113563] [2023-12-16 19:19:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,674 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,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590113563] [2023-12-16 19:19:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590113563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738869590] [2023-12-16 19:19:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:40,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:40,675 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:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:40,805 INFO L93 Difference]: Finished difference Result 1186 states and 1910 transitions. [2023-12-16 19:19:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:40,805 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:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:40,807 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:40,807 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:40,808 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:40,809 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1045 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1996 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:40,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1996 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:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:40,819 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:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1057 transitions. [2023-12-16 19:19:40,820 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1057 transitions. Word has length 237 [2023-12-16 19:19:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:40,821 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1057 transitions. [2023-12-16 19:19:40,821 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:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1057 transitions. [2023-12-16 19:19:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-16 19:19:40,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:40,822 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:40,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 19:19:40,822 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:40,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -623276056, now seen corresponding path program 1 times [2023-12-16 19:19:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227260600] [2023-12-16 19:19:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,196 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,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227260600] [2023-12-16 19:19:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227260600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:41,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:41,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790636008] [2023-12-16 19:19:41,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:41,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:41,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:41,197 INFO L87 Difference]: Start difference. First operand 655 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 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:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:41,310 INFO L93 Difference]: Finished difference Result 1186 states and 1908 transitions. [2023-12-16 19:19:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 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:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:41,313 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:41,313 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:41,314 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:41,314 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1041 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1996 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:41,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1996 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:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:41,324 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:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1056 transitions. [2023-12-16 19:19:41,325 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1056 transitions. Word has length 238 [2023-12-16 19:19:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:41,325 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1056 transitions. [2023-12-16 19:19:41,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 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:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1056 transitions. [2023-12-16 19:19:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-16 19:19:41,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:41,327 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:41,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 19:19:41,327 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:41,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1848052430, now seen corresponding path program 1 times [2023-12-16 19:19:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118853114] [2023-12-16 19:19:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,662 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,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:41,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118853114] [2023-12-16 19:19:41,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118853114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:41,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:41,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229824558] [2023-12-16 19:19:41,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:41,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:41,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:41,664 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:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:41,773 INFO L93 Difference]: Finished difference Result 1186 states and 1906 transitions. [2023-12-16 19:19:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:41,773 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:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:41,775 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:41,775 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:41,776 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:41,776 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1927 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 1990 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:41,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 1990 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:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:41,787 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:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1055 transitions. [2023-12-16 19:19:41,789 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1055 transitions. Word has length 239 [2023-12-16 19:19:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:41,789 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1055 transitions. [2023-12-16 19:19:41,789 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:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1055 transitions. [2023-12-16 19:19:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-16 19:19:41,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:41,791 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:41,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 19:19:41,791 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:41,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1731792526, now seen corresponding path program 1 times [2023-12-16 19:19:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703193] [2023-12-16 19:19:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,111 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,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703193] [2023-12-16 19:19:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895565198] [2023-12-16 19:19:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:42,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:42,113 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:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:42,227 INFO L93 Difference]: Finished difference Result 1186 states and 1904 transitions. [2023-12-16 19:19:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:42,228 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:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:42,230 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:42,230 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:42,230 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:42,231 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1919 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 1990 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:42,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 1990 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:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:42,241 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:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1054 transitions. [2023-12-16 19:19:42,243 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1054 transitions. Word has length 240 [2023-12-16 19:19:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:42,243 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1054 transitions. [2023-12-16 19:19:42,243 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:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1054 transitions. [2023-12-16 19:19:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-16 19:19:42,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:42,244 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:42,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 19:19:42,244 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:42,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 196155288, now seen corresponding path program 1 times [2023-12-16 19:19:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:42,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240652560] [2023-12-16 19:19:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:42,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,547 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,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:42,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240652560] [2023-12-16 19:19:42,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240652560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:42,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:42,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458744026] [2023-12-16 19:19:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:42,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:42,549 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:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:42,659 INFO L93 Difference]: Finished difference Result 1186 states and 1902 transitions. [2023-12-16 19:19:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:42,659 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:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:42,661 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:42,661 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:42,662 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:42,663 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1026 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1996 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:42,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1996 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:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:42,671 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:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1053 transitions. [2023-12-16 19:19:42,673 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1053 transitions. Word has length 241 [2023-12-16 19:19:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:42,673 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1053 transitions. [2023-12-16 19:19:42,673 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:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1053 transitions. [2023-12-16 19:19:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-16 19:19:42,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:42,674 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:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 19:19:42,675 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:42,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1094354546, now seen corresponding path program 1 times [2023-12-16 19:19:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037459987] [2023-12-16 19:19:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,338 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,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037459987] [2023-12-16 19:19:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037459987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:43,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:43,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:43,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919383393] [2023-12-16 19:19:43,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:43,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:43,340 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:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:43,383 INFO L93 Difference]: Finished difference Result 1186 states and 1900 transitions. [2023-12-16 19:19:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:43,383 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:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:43,385 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:43,385 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:43,386 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:43,386 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:43,386 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:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:43,394 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:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2023-12-16 19:19:43,395 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 242 [2023-12-16 19:19:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:43,396 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2023-12-16 19:19:43,396 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:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2023-12-16 19:19:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-16 19:19:43,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:43,397 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:43,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 19:19:43,397 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:43,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1763849704, now seen corresponding path program 1 times [2023-12-16 19:19:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11253456] [2023-12-16 19:19:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,840 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,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:43,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11253456] [2023-12-16 19:19:43,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11253456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:43,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:43,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:43,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026120596] [2023-12-16 19:19:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:43,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:43,842 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:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:44,211 INFO L93 Difference]: Finished difference Result 1186 states and 1898 transitions. [2023-12-16 19:19:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:44,212 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:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:44,214 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:44,214 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:44,214 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:44,215 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 918 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:44,215 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:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:44,224 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:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1050 transitions. [2023-12-16 19:19:44,225 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1050 transitions. Word has length 243 [2023-12-16 19:19:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:44,225 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1050 transitions. [2023-12-16 19:19:44,225 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:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1050 transitions. [2023-12-16 19:19:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:44,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:44,226 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:44,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 19:19:44,227 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:44,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -291499650, now seen corresponding path program 1 times [2023-12-16 19:19:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873921766] [2023-12-16 19:19:44,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,788 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,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:44,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873921766] [2023-12-16 19:19:44,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873921766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:44,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:44,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886800601] [2023-12-16 19:19:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:44,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:44,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:44,790 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:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:44,893 INFO L93 Difference]: Finished difference Result 1186 states and 1894 transitions. [2023-12-16 19:19:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:44,894 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,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:44,896 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:44,896 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:44,897 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:44,897 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 908 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:44,897 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:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:44,907 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:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1049 transitions. [2023-12-16 19:19:44,908 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1049 transitions. Word has length 244 [2023-12-16 19:19:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:44,908 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1049 transitions. [2023-12-16 19:19:44,908 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,909 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1049 transitions. [2023-12-16 19:19:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:44,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:44,911 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:44,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 19:19:44,912 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:44,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1175008640, now seen corresponding path program 1 times [2023-12-16 19:19:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872062396] [2023-12-16 19:19:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,509 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,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872062396] [2023-12-16 19:19:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872062396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994393266] [2023-12-16 19:19:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:45,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:45,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:45,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:45,511 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:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:45,600 INFO L93 Difference]: Finished difference Result 1186 states and 1892 transitions. [2023-12-16 19:19:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:45,601 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:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:45,603 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:45,603 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:45,604 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:45,604 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 1807 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:45,604 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.1s Time] [2023-12-16 19:19:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:45,614 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:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1048 transitions. [2023-12-16 19:19:45,615 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1048 transitions. Word has length 244 [2023-12-16 19:19:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:45,615 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1048 transitions. [2023-12-16 19:19:45,615 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:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1048 transitions. [2023-12-16 19:19:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:45,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:45,616 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:45,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 19:19:45,616 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:45,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 702054590, now seen corresponding path program 1 times [2023-12-16 19:19:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901243885] [2023-12-16 19:19:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,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:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901243885] [2023-12-16 19:19:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901243885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:46,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955296716] [2023-12-16 19:19:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:46,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:46,107 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:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:46,181 INFO L93 Difference]: Finished difference Result 1186 states and 1890 transitions. [2023-12-16 19:19:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:46,182 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:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:46,184 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:46,184 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:46,185 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:46,185 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:46,185 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:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:46,196 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:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1047 transitions. [2023-12-16 19:19:46,197 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1047 transitions. Word has length 244 [2023-12-16 19:19:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:46,197 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1047 transitions. [2023-12-16 19:19:46,197 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:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1047 transitions. [2023-12-16 19:19:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:46,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:46,198 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:46,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 19:19:46,199 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:46,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash 115778368, now seen corresponding path program 1 times [2023-12-16 19:19:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368866881] [2023-12-16 19:19:46,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:46,683 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:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:46,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368866881] [2023-12-16 19:19:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368866881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:46,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:46,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425678438] [2023-12-16 19:19:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:46,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:46,685 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:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:46,797 INFO L93 Difference]: Finished difference Result 1186 states and 1888 transitions. [2023-12-16 19:19:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:46,797 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:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:46,807 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:46,807 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:46,808 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:46,808 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:46,808 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:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:46,819 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:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1046 transitions. [2023-12-16 19:19:46,820 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1046 transitions. Word has length 244 [2023-12-16 19:19:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:46,820 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1046 transitions. [2023-12-16 19:19:46,820 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:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1046 transitions. [2023-12-16 19:19:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:46,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:46,822 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:46,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 19:19:46,822 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:46,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash -942059710, now seen corresponding path program 1 times [2023-12-16 19:19:46,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:46,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892185986] [2023-12-16 19:19:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,369 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,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892185986] [2023-12-16 19:19:47,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892185986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:47,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:47,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298836172] [2023-12-16 19:19:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:47,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:47,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:47,372 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:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:47,499 INFO L93 Difference]: Finished difference Result 1186 states and 1886 transitions. [2023-12-16 19:19:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:47,500 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:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:47,502 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:47,502 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:47,503 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:47,503 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:47,503 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:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:47,514 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:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1045 transitions. [2023-12-16 19:19:47,515 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1045 transitions. Word has length 244 [2023-12-16 19:19:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:47,515 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1045 transitions. [2023-12-16 19:19:47,515 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:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1045 transitions. [2023-12-16 19:19:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:47,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:47,533 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:47,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 19:19:47,533 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:47,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -103026048, now seen corresponding path program 1 times [2023-12-16 19:19:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669956296] [2023-12-16 19:19:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,170 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:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669956296] [2023-12-16 19:19:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669956296] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:48,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:48,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410300168] [2023-12-16 19:19:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:48,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:48,171 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:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:48,291 INFO L93 Difference]: Finished difference Result 1186 states and 1884 transitions. [2023-12-16 19:19:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:48,291 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:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:48,293 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:48,293 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:48,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:48,294 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:48,294 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:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:48,304 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:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1044 transitions. [2023-12-16 19:19:48,305 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1044 transitions. Word has length 244 [2023-12-16 19:19:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:48,305 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1044 transitions. [2023-12-16 19:19:48,305 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:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1044 transitions. [2023-12-16 19:19:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:48,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:48,307 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:48,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 19:19:48,307 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:48,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1631078402, now seen corresponding path program 1 times [2023-12-16 19:19:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252578976] [2023-12-16 19:19:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:48,749 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:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252578976] [2023-12-16 19:19:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252578976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542656448] [2023-12-16 19:19:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:48,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:48,750 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:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:48,863 INFO L93 Difference]: Finished difference Result 1186 states and 1882 transitions. [2023-12-16 19:19:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:48,863 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:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:48,864 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:48,864 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:48,865 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:48,865 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 888 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1984 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:48,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1984 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:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:48,876 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:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1043 transitions. [2023-12-16 19:19:48,877 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1043 transitions. Word has length 244 [2023-12-16 19:19:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:48,877 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1043 transitions. [2023-12-16 19:19:48,877 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:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1043 transitions. [2023-12-16 19:19:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:48,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:48,879 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:48,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-16 19:19:48,879 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:48,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1707979200, now seen corresponding path program 1 times [2023-12-16 19:19:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093569559] [2023-12-16 19:19:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,438 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,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093569559] [2023-12-16 19:19:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093569559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:49,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:49,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:49,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581861908] [2023-12-16 19:19:49,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:49,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:49,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:49,440 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:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:49,538 INFO L93 Difference]: Finished difference Result 1186 states and 1880 transitions. [2023-12-16 19:19:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:49,538 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:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:49,540 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:49,540 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:49,540 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:49,542 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:49,542 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:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:49,555 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:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1042 transitions. [2023-12-16 19:19:49,557 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1042 transitions. Word has length 244 [2023-12-16 19:19:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:49,557 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1042 transitions. [2023-12-16 19:19:49,557 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:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1042 transitions. [2023-12-16 19:19:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:49,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:49,559 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:49,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-16 19:19:49,559 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:49,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:49,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1215353026, now seen corresponding path program 1 times [2023-12-16 19:19:49,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342902193] [2023-12-16 19:19:49,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:49,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,032 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:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342902193] [2023-12-16 19:19:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342902193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828869125] [2023-12-16 19:19:50,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:50,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:50,034 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:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:50,141 INFO L93 Difference]: Finished difference Result 1186 states and 1878 transitions. [2023-12-16 19:19:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:50,141 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:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:50,143 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:50,143 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:50,143 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:50,144 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 1757 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1978 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:50,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1978 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:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:50,155 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:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1041 transitions. [2023-12-16 19:19:50,156 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1041 transitions. Word has length 244 [2023-12-16 19:19:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:50,156 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1041 transitions. [2023-12-16 19:19:50,156 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:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1041 transitions. [2023-12-16 19:19:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:50,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:50,158 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:50,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-16 19:19:50,158 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:50,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 483385600, now seen corresponding path program 1 times [2023-12-16 19:19:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193826158] [2023-12-16 19:19:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:50,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:50,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:50,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193826158] [2023-12-16 19:19:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193826158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:50,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:50,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946005606] [2023-12-16 19:19:50,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:50,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:50,576 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:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:50,690 INFO L93 Difference]: Finished difference Result 1186 states and 1876 transitions. [2023-12-16 19:19:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:50,690 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:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:50,692 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:50,692 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:50,693 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:50,698 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:50,699 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:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:50,710 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:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1040 transitions. [2023-12-16 19:19:50,711 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1040 transitions. Word has length 244 [2023-12-16 19:19:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:50,712 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1040 transitions. [2023-12-16 19:19:50,713 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:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1040 transitions. [2023-12-16 19:19:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:50,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:50,714 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:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-16 19:19:50,714 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:50,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 65988994, now seen corresponding path program 1 times [2023-12-16 19:19:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678041743] [2023-12-16 19:19:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,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:51,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:51,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678041743] [2023-12-16 19:19:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678041743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:51,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:51,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663826835] [2023-12-16 19:19:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:51,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:51,041 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:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:51,083 INFO L93 Difference]: Finished difference Result 1186 states and 1874 transitions. [2023-12-16 19:19:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:51,084 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:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:51,085 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:51,085 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:51,086 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:51,086 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:51,086 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:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:51,095 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:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1039 transitions. [2023-12-16 19:19:51,096 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1039 transitions. Word has length 244 [2023-12-16 19:19:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:51,097 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1039 transitions. [2023-12-16 19:19:51,097 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:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1039 transitions. [2023-12-16 19:19:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:51,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:51,098 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:51,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-16 19:19:51,098 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:51,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1997114628, now seen corresponding path program 1 times [2023-12-16 19:19:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012252347] [2023-12-16 19:19:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,493 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:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012252347] [2023-12-16 19:19:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012252347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453937013] [2023-12-16 19:19:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:51,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:51,495 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:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:51,534 INFO L93 Difference]: Finished difference Result 1186 states and 1872 transitions. [2023-12-16 19:19:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:51,535 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:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:51,536 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:51,536 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:51,537 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:51,538 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:51,538 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:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:51,548 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:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1038 transitions. [2023-12-16 19:19:51,549 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1038 transitions. Word has length 244 [2023-12-16 19:19:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:51,551 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1038 transitions. [2023-12-16 19:19:51,551 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:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1038 transitions. [2023-12-16 19:19:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:51,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:51,552 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:51,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-16 19:19:51,552 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:51,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1266811770, now seen corresponding path program 1 times [2023-12-16 19:19:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051099202] [2023-12-16 19:19:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,902 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:51,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:51,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051099202] [2023-12-16 19:19:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051099202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:51,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657269473] [2023-12-16 19:19:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:51,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:51,904 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:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:52,075 INFO L93 Difference]: Finished difference Result 1186 states and 1870 transitions. [2023-12-16 19:19:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:52,076 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:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:52,077 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:52,077 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:52,078 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:52,078 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 859 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:52,078 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.1s Time] [2023-12-16 19:19:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:52,087 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:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1037 transitions. [2023-12-16 19:19:52,088 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1037 transitions. Word has length 244 [2023-12-16 19:19:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:52,088 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1037 transitions. [2023-12-16 19:19:52,088 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:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1037 transitions. [2023-12-16 19:19:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:52,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:52,089 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:52,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-16 19:19:52,089 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:52,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash -5894520, now seen corresponding path program 1 times [2023-12-16 19:19:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367585637] [2023-12-16 19:19:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:52,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:52,516 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:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367585637] [2023-12-16 19:19:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367585637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210218615] [2023-12-16 19:19:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:52,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:52,518 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:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:52,708 INFO L93 Difference]: Finished difference Result 1186 states and 1868 transitions. [2023-12-16 19:19:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:52,709 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:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:52,710 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:52,710 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:52,710 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:52,711 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1711 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 1848 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:52,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 1848 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:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:52,725 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:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1036 transitions. [2023-12-16 19:19:52,726 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1036 transitions. Word has length 244 [2023-12-16 19:19:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:52,726 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1036 transitions. [2023-12-16 19:19:52,726 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:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1036 transitions. [2023-12-16 19:19:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:52,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:52,727 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:52,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-16 19:19:52,729 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:52,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 870124486, now seen corresponding path program 1 times [2023-12-16 19:19:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341892208] [2023-12-16 19:19:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,157 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:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341892208] [2023-12-16 19:19:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341892208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83441635] [2023-12-16 19:19:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:53,159 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:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:53,346 INFO L93 Difference]: Finished difference Result 1186 states and 1866 transitions. [2023-12-16 19:19:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:53,347 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:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:53,348 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:53,348 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:53,349 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:53,349 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:53,349 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:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:53,377 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:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1035 transitions. [2023-12-16 19:19:53,378 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1035 transitions. Word has length 244 [2023-12-16 19:19:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:53,378 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1035 transitions. [2023-12-16 19:19:53,378 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:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1035 transitions. [2023-12-16 19:19:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:53,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:53,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:53,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-16 19:19:53,380 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:53,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1158461624, now seen corresponding path program 1 times [2023-12-16 19:19:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814867566] [2023-12-16 19:19:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,785 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:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814867566] [2023-12-16 19:19:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814867566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455214853] [2023-12-16 19:19:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:53,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:53,787 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:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:53,968 INFO L93 Difference]: Finished difference Result 1186 states and 1864 transitions. [2023-12-16 19:19:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:53,969 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:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:53,970 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:53,970 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:53,971 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:53,971 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:53,971 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:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:53,980 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:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1034 transitions. [2023-12-16 19:19:53,981 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1034 transitions. Word has length 244 [2023-12-16 19:19:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:53,981 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1034 transitions. [2023-12-16 19:19:53,981 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:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1034 transitions. [2023-12-16 19:19:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:53,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:53,982 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:53,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-12-16 19:19:53,982 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:53,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash 780700422, now seen corresponding path program 1 times [2023-12-16 19:19:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196306566] [2023-12-16 19:19:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,399 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:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196306566] [2023-12-16 19:19:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196306566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:54,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:54,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052810517] [2023-12-16 19:19:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:54,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:54,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:54,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:54,400 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:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:54,581 INFO L93 Difference]: Finished difference Result 1186 states and 1862 transitions. [2023-12-16 19:19:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:54,582 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:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:54,583 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:54,583 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:54,584 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:54,584 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:54,584 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.1s Time] [2023-12-16 19:19:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:54,593 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:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1033 transitions. [2023-12-16 19:19:54,594 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1033 transitions. Word has length 244 [2023-12-16 19:19:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:54,594 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1033 transitions. [2023-12-16 19:19:54,594 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:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1033 transitions. [2023-12-16 19:19:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:54,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:54,595 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:54,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-12-16 19:19:54,596 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:54,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1674186760, now seen corresponding path program 1 times [2023-12-16 19:19:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:54,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875047940] [2023-12-16 19:19:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:54,990 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:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875047940] [2023-12-16 19:19:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875047940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:54,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:54,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127211662] [2023-12-16 19:19:54,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:54,992 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:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:55,173 INFO L93 Difference]: Finished difference Result 1186 states and 1860 transitions. [2023-12-16 19:19:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:55,174 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:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:55,175 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:55,175 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:55,176 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:55,176 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:55,176 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:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:55,185 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:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1032 transitions. [2023-12-16 19:19:55,186 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1032 transitions. Word has length 244 [2023-12-16 19:19:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:55,187 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1032 transitions. [2023-12-16 19:19:55,187 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:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1032 transitions. [2023-12-16 19:19:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:55,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:55,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, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-12-16 19:19:55,188 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:55,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1922333254, now seen corresponding path program 1 times [2023-12-16 19:19:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053553418] [2023-12-16 19:19:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:55,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:55,606 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:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053553418] [2023-12-16 19:19:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053553418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:55,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:55,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:55,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895051331] [2023-12-16 19:19:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:55,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:55,610 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:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:55,842 INFO L93 Difference]: Finished difference Result 1186 states and 1858 transitions. [2023-12-16 19:19:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:55,843 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:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:55,844 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:55,844 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:55,844 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:55,846 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1686 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:55,846 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:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:55,855 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:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1031 transitions. [2023-12-16 19:19:55,856 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1031 transitions. Word has length 244 [2023-12-16 19:19:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:55,856 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1031 transitions. [2023-12-16 19:19:55,856 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:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1031 transitions. [2023-12-16 19:19:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:55,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:55,857 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:55,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-12-16 19:19:55,857 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:55,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash 76966088, now seen corresponding path program 1 times [2023-12-16 19:19:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:55,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206446754] [2023-12-16 19:19:55,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,244 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:56,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:56,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206446754] [2023-12-16 19:19:56,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206446754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:56,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:56,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487943357] [2023-12-16 19:19:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:56,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:56,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:56,245 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:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:56,473 INFO L93 Difference]: Finished difference Result 1186 states and 1856 transitions. [2023-12-16 19:19:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:56,473 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:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:56,475 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:56,475 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:56,475 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:56,475 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1681 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1848 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:56,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1848 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:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:56,492 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:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1030 transitions. [2023-12-16 19:19:56,495 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1030 transitions. Word has length 244 [2023-12-16 19:19:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:56,495 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1030 transitions. [2023-12-16 19:19:56,495 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:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1030 transitions. [2023-12-16 19:19:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:56,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-12-16 19:19:56,497 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:56,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -317400698, now seen corresponding path program 1 times [2023-12-16 19:19:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590447537] [2023-12-16 19:19:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,899 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:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590447537] [2023-12-16 19:19:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590447537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336433123] [2023-12-16 19:19:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:56,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:56,903 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:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:57,096 INFO L93 Difference]: Finished difference Result 1186 states and 1854 transitions. [2023-12-16 19:19:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:57,096 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:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:57,097 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:57,098 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:57,102 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:57,102 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 850 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:57,102 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:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:57,125 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:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1029 transitions. [2023-12-16 19:19:57,127 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1029 transitions. Word has length 244 [2023-12-16 19:19:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:57,127 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1029 transitions. [2023-12-16 19:19:57,127 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:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1029 transitions. [2023-12-16 19:19:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:57,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:57,128 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:57,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-12-16 19:19:57,128 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:57,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -389787256, now seen corresponding path program 1 times [2023-12-16 19:19:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699562693] [2023-12-16 19:19:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:57,529 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:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699562693] [2023-12-16 19:19:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699562693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811702851] [2023-12-16 19:19:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:57,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:57,531 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:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:57,750 INFO L93 Difference]: Finished difference Result 1186 states and 1852 transitions. [2023-12-16 19:19:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:57,751 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:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:57,753 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:57,753 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:57,754 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:57,754 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1671 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 1848 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.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:57,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 1848 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:57,763 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:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1028 transitions. [2023-12-16 19:19:57,764 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1028 transitions. Word has length 244 [2023-12-16 19:19:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:57,764 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1028 transitions. [2023-12-16 19:19:57,764 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:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1028 transitions. [2023-12-16 19:19:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:57,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:57,765 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:57,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-12-16 19:19:57,765 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:57,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash -367155002, now seen corresponding path program 1 times [2023-12-16 19:19:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159941882] [2023-12-16 19:19:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,175 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:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159941882] [2023-12-16 19:19:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159941882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:58,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:58,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:58,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134388243] [2023-12-16 19:19:58,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:58,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:58,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:58,176 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:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:58,361 INFO L93 Difference]: Finished difference Result 1186 states and 1850 transitions. [2023-12-16 19:19:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:58,362 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:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:58,363 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:58,363 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:58,364 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:58,365 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 848 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1854 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:58,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1854 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:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:58,375 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:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1027 transitions. [2023-12-16 19:19:58,376 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1027 transitions. Word has length 244 [2023-12-16 19:19:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:58,376 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1027 transitions. [2023-12-16 19:19:58,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:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1027 transitions. [2023-12-16 19:19:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:58,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:58,378 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:58,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-12-16 19:19:58,378 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:58,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1556073032, now seen corresponding path program 1 times [2023-12-16 19:19:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241938980] [2023-12-16 19:19:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,768 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:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241938980] [2023-12-16 19:19:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241938980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174174486] [2023-12-16 19:19:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:58,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:58,770 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:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:58,967 INFO L93 Difference]: Finished difference Result 1186 states and 1848 transitions. [2023-12-16 19:19:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:58,967 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:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:58,970 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:58,970 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:58,970 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:58,971 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1661 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 1848 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:58,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 1848 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:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:58,981 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:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1026 transitions. [2023-12-16 19:19:58,982 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1026 transitions. Word has length 244 [2023-12-16 19:19:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:58,982 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1026 transitions. [2023-12-16 19:19:58,982 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:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1026 transitions. [2023-12-16 19:19:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:58,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:58,983 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:58,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-12-16 19:19:58,984 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:58,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1422059526, now seen corresponding path program 1 times [2023-12-16 19:19:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313480550] [2023-12-16 19:19:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:59,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:59,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313480550] [2023-12-16 19:19:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313480550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:59,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087562439] [2023-12-16 19:19:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:59,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:59,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:59,395 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:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:59,618 INFO L93 Difference]: Finished difference Result 1186 states and 1846 transitions. [2023-12-16 19:19:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:59,619 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:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:59,620 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:59,620 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:59,620 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:59,621 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1656 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 1848 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:59,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 1848 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:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:59,629 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:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1025 transitions. [2023-12-16 19:19:59,630 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1025 transitions. Word has length 244 [2023-12-16 19:19:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:59,631 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1025 transitions. [2023-12-16 19:19:59,631 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:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1025 transitions. [2023-12-16 19:19:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:59,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:59,632 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:59,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-12-16 19:19:59,632 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:59,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:59,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1844761352, now seen corresponding path program 1 times [2023-12-16 19:19:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:59,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422872382] [2023-12-16 19:19:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:20:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:20:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:20:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,038 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:20:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422872382] [2023-12-16 19:20:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422872382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:00,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:00,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:20:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561212922] [2023-12-16 19:20:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:00,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:20:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:00,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:20:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:20:00,039 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:20:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:00,218 INFO L93 Difference]: Finished difference Result 1186 states and 1844 transitions. [2023-12-16 19:20:00,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:20:00,218 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:20:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:00,220 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:20:00,220 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:20:00,220 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:20:00,221 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.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:00,221 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.2s Time] [2023-12-16 19:20:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:20:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:20:00,230 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:20:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1024 transitions. [2023-12-16 19:20:00,231 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1024 transitions. Word has length 244 [2023-12-16 19:20:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:00,231 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1024 transitions. [2023-12-16 19:20:00,231 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:20:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1024 transitions. [2023-12-16 19:20:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:20:00,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:00,232 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:20:00,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-12-16 19:20:00,232 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:00,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -149383354, now seen corresponding path program 1 times [2023-12-16 19:20:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344517330] [2023-12-16 19:20:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:20:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:20:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:20:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:00,631 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:20:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344517330] [2023-12-16 19:20:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344517330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:00,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:00,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:20:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305273556] [2023-12-16 19:20:00,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:00,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:20:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:00,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:20:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:20:00,633 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:20:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:00,848 INFO L93 Difference]: Finished difference Result 1186 states and 1842 transitions. [2023-12-16 19:20:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:20:00,860 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:20:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:00,862 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:20:00,862 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:20:00,862 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:20:00,863 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 844 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:00,863 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.2s Time] [2023-12-16 19:20:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:20:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:20:00,872 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:20:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1023 transitions. [2023-12-16 19:20:00,873 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1023 transitions. Word has length 244 [2023-12-16 19:20:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:00,873 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1023 transitions. [2023-12-16 19:20:00,873 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:20:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1023 transitions. [2023-12-16 19:20:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:20:00,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:00,874 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:20:00,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-12-16 19:20:00,874 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:00,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1429247032, now seen corresponding path program 1 times [2023-12-16 19:20:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931725769] [2023-12-16 19:20:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:20:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:20:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:20:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,431 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:20:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931725769] [2023-12-16 19:20:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931725769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:01,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:20:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426939708] [2023-12-16 19:20:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:01,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:20:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:20:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:20:01,433 INFO L87 Difference]: Start difference. First operand 655 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 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:20:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:01,917 INFO L93 Difference]: Finished difference Result 1245 states and 1931 transitions. [2023-12-16 19:20:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:20:01,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 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:20:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:01,919 INFO L225 Difference]: With dead ends: 1245 [2023-12-16 19:20:01,919 INFO L226 Difference]: Without dead ends: 663 [2023-12-16 19:20:01,920 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:20:01,921 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 1914 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 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.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:01,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 4031 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:20:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2023-12-16 19:20:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 657. [2023-12-16 19:20:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 652 states have (on average 1.5613496932515338) internal successors, (1018), 652 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:20:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1024 transitions. [2023-12-16 19:20:01,935 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1024 transitions. Word has length 244 [2023-12-16 19:20:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:01,936 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 1024 transitions. [2023-12-16 19:20:01,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 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:20:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1024 transitions. [2023-12-16 19:20:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-16 19:20:01,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:01,937 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:20:01,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-12-16 19:20:01,937 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:01,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1622460194, now seen corresponding path program 1 times [2023-12-16 19:20:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634656361] [2023-12-16 19:20:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:20:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:20:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:20:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,632 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:20:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634656361] [2023-12-16 19:20:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634656361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:02,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:02,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:20:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385087160] [2023-12-16 19:20:02,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:02,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:20:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:02,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:20:02,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:20:02,634 INFO L87 Difference]: Start difference. First operand 657 states and 1024 transitions. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 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:20:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:03,000 INFO L93 Difference]: Finished difference Result 1194 states and 1848 transitions. [2023-12-16 19:20:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:20:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 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:20:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:03,002 INFO L225 Difference]: With dead ends: 1194 [2023-12-16 19:20:03,002 INFO L226 Difference]: Without dead ends: 661 [2023-12-16 19:20:03,003 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:20:03,003 INFO L413 NwaCegarLoop]: 806 mSDtfsCounter, 980 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:03,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 2407 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:20:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-12-16 19:20:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2023-12-16 19:20:03,017 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:20:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1026 transitions. [2023-12-16 19:20:03,018 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1026 transitions. Word has length 245 [2023-12-16 19:20:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:03,019 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 1026 transitions. [2023-12-16 19:20:03,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 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:20:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1026 transitions. [2023-12-16 19:20:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-16 19:20:03,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:03,020 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:20:03,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-12-16 19:20:03,020 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:03,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 94871982, now seen corresponding path program 1 times [2023-12-16 19:20:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:03,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647490297] [2023-12-16 19:20:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:20:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:20:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:20:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:03,668 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:20:03,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:03,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647490297] [2023-12-16 19:20:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647490297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:03,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:20:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377824768] [2023-12-16 19:20:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:03,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:20:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:20:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:20:03,670 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:20:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:04,116 INFO L93 Difference]: Finished difference Result 1259 states and 1947 transitions. [2023-12-16 19:20:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 19:20:04,116 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:20:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:04,118 INFO L225 Difference]: With dead ends: 1259 [2023-12-16 19:20:04,118 INFO L226 Difference]: Without dead ends: 665 [2023-12-16 19:20:04,118 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:20:04,119 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 1806 mSDsluCounter, 3942 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 4995 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:04,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 4995 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:20:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-16 19:20:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 660. [2023-12-16 19:20:04,130 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:20:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1027 transitions. [2023-12-16 19:20:04,131 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1027 transitions. Word has length 246 [2023-12-16 19:20:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:04,131 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 1027 transitions. [2023-12-16 19:20:04,131 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:20:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1027 transitions. [2023-12-16 19:20:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-16 19:20:04,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:04,132 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:20:04,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-12-16 19:20:04,133 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:04,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 439700144, now seen corresponding path program 1 times [2023-12-16 19:20:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185107017] [2023-12-16 19:20:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:20:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:20:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:20:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,917 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:20:04,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185107017] [2023-12-16 19:20:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185107017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:04,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:04,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:20:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169179872] [2023-12-16 19:20:04,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:04,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:20:04,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:20:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:20:04,918 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:20:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:05,004 INFO L93 Difference]: Finished difference Result 1938 states and 2896 transitions. [2023-12-16 19:20:05,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:20:05,005 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:20:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:05,009 INFO L225 Difference]: With dead ends: 1938 [2023-12-16 19:20:05,009 INFO L226 Difference]: Without dead ends: 1402 [2023-12-16 19:20:05,010 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:20:05,010 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:20:05,014 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:20:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2023-12-16 19:20:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 766. [2023-12-16 19:20:05,033 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:20:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1143 transitions. [2023-12-16 19:20:05,035 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1143 transitions. Word has length 246 [2023-12-16 19:20:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:05,035 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1143 transitions. [2023-12-16 19:20:05,035 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:20:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1143 transitions. [2023-12-16 19:20:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 19:20:05,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:05,037 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:20:05,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-12-16 19:20:05,037 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:05,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash 574494380, now seen corresponding path program 1 times [2023-12-16 19:20:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133126625] [2023-12-16 19:20:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:20:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:20:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:20:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,338 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:20:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133126625] [2023-12-16 19:20:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133126625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:05,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:20:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753609036] [2023-12-16 19:20:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:05,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:20:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:20:05,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:20:05,339 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:20:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:05,401 INFO L93 Difference]: Finished difference Result 1965 states and 2937 transitions. [2023-12-16 19:20:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:20:05,402 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:20:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:05,404 INFO L225 Difference]: With dead ends: 1965 [2023-12-16 19:20:05,404 INFO L226 Difference]: Without dead ends: 1323 [2023-12-16 19:20:05,405 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:20:05,405 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:20:05,405 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:20:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-12-16 19:20:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 780. [2023-12-16 19:20:05,421 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:20:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1165 transitions. [2023-12-16 19:20:05,423 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1165 transitions. Word has length 247 [2023-12-16 19:20:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:05,423 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1165 transitions. [2023-12-16 19:20:05,423 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:20:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1165 transitions. [2023-12-16 19:20:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 19:20:05,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:05,424 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:20:05,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-12-16 19:20:05,424 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:05,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 121340330, now seen corresponding path program 1 times [2023-12-16 19:20:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739405907] [2023-12-16 19:20:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:20:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:20:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:20:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,932 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:20:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739405907] [2023-12-16 19:20:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739405907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:05,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:20:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767175698] [2023-12-16 19:20:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:05,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:20:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:20:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:20:05,933 INFO L87 Difference]: Start difference. First operand 780 states and 1165 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 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) [2023-12-16 19:20:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:06,409 INFO L93 Difference]: Finished difference Result 1472 states and 2177 transitions. [2023-12-16 19:20:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:20:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 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) Word has length 247 [2023-12-16 19:20:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:06,411 INFO L225 Difference]: With dead ends: 1472 [2023-12-16 19:20:06,411 INFO L226 Difference]: Without dead ends: 816 [2023-12-16 19:20:06,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:20:06,412 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 1814 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:06,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 2699 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:20:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2023-12-16 19:20:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 782. [2023-12-16 19:20:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 777 states have (on average 1.492921492921493) internal successors, (1160), 777 states have internal predecessors, (1160), 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:20:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1166 transitions. [2023-12-16 19:20:06,426 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1166 transitions. Word has length 247 [2023-12-16 19:20:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:06,427 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1166 transitions. [2023-12-16 19:20:06,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 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) [2023-12-16 19:20:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1166 transitions. [2023-12-16 19:20:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-16 19:20:06,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:06,428 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, 1] [2023-12-16 19:20:06,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-12-16 19:20:06,428 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 402971820, now seen corresponding path program 1 times [2023-12-16 19:20:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685837843] [2023-12-16 19:20:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 19:20:07,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2023-12-16 19:20:07,397 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 19:20:07,400 INFO L158 Benchmark]: Toolchain (without parser) took 46694.22ms. Allocated memory was 249.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 194.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 186.6MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.46ms. Allocated memory is still 249.6MB. Free memory was 193.6MB in the beginning and 139.6MB in the end (delta: 54.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 240.55ms. Allocated memory is still 249.6MB. Free memory was 139.6MB in the beginning and 148.9MB in the end (delta: -9.3MB). Peak memory consumption was 16.4MB. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 INFO L158 Benchmark]: Boogie Preprocessor took 327.38ms. Allocated memory is still 249.6MB. Free memory was 148.9MB in the beginning and 114.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 INFO L158 Benchmark]: RCFGBuilder took 2057.91ms. Allocated memory was 249.6MB in the beginning and 499.1MB in the end (delta: 249.6MB). Free memory was 113.8MB in the beginning and 324.8MB in the end (delta: -211.1MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 INFO L158 Benchmark]: TraceAbstraction took 43593.27ms. Allocated memory was 499.1MB in the beginning and 1.9GB in the end (delta: 1.4GB). Free memory was 324.3MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-16 19:20:07,401 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.19ms. Allocated memory is still 186.6MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.46ms. Allocated memory is still 249.6MB. Free memory was 193.6MB in the beginning and 139.6MB in the end (delta: 54.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 240.55ms. Allocated memory is still 249.6MB. Free memory was 139.6MB in the beginning and 148.9MB in the end (delta: -9.3MB). Peak memory consumption was 16.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 327.38ms. Allocated memory is still 249.6MB. Free memory was 148.9MB in the beginning and 114.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * RCFGBuilder took 2057.91ms. Allocated memory was 249.6MB in the beginning and 499.1MB in the end (delta: 249.6MB). Free memory was 113.8MB in the beginning and 324.8MB in the end (delta: -211.1MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB. * TraceAbstraction took 43593.27ms. Allocated memory was 499.1MB in the beginning and 1.9GB in the end (delta: 1.4GB). Free memory was 324.3MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown