/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_w128_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:18:23,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:18:23,976 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:18:23,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:18:23,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:18:24,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:18:24,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:18:24,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:18:24,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:18:24,008 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:18:24,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:18:24,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:18:24,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:18:24,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:18:24,010 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:18:24,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:18:24,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:18:24,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:18:24,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:18:24,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:18:24,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:18:24,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:18:24,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:18:24,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:18:24,012 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:18:24,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:18:24,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:18:24,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:18:24,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:18:24,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:18:24,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:18:24,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:18:24,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:18:24,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:18:24,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:18:24,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:18:24,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:18:24,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:18:24,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:18:24,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:18:24,015 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:18:24,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:18:24,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:18:24,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:18:24,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:18:24,246 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:18:24,247 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_w128_d8_e0.c [2023-12-16 19:18:25,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:18:25,445 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:18:25,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2023-12-16 19:18:25,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e8a803e/3c12d03673cd45be951041b028dbfbac/FLAG846ce9c1c [2023-12-16 19:18:25,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e8a803e/3c12d03673cd45be951041b028dbfbac [2023-12-16 19:18:25,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:18:25,473 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:18:25,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:18:25,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:18:25,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:18:25,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:25,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aff8b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25, skipping insertion in model container [2023-12-16 19:18:25,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:25,514 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:18:25,614 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_w128_d8_e0.c[1334,1347] [2023-12-16 19:18:25,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:18:25,747 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:18:25,754 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_w128_d8_e0.c[1334,1347] [2023-12-16 19:18:25,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:18:25,870 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:18:25,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25 WrapperNode [2023-12-16 19:18:25,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:18:25,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:18:25,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:18:25,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:18:25,876 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:18:25" (1/1) ... [2023-12-16 19:18:25,902 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:18:25" (1/1) ... [2023-12-16 19:18:26,000 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1535 [2023-12-16 19:18:26,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:18:26,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:18:26,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:18:26,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:18:26,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,134 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:18:26,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:18:26,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:18:26,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:18:26,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:18:26,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (1/1) ... [2023-12-16 19:18:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:18:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:18:26,233 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:18:26,252 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:18:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:18:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 19:18:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 19:18:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:18:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:18:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:18:26,501 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:18:26,502 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:18:27,422 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:18:27,450 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:18:27,450 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:18:27,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:18:27 BoogieIcfgContainer [2023-12-16 19:18:27,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:18:27,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:18:27,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:18:27,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:18:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:18:25" (1/3) ... [2023-12-16 19:18:27,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7644d0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:18:27, skipping insertion in model container [2023-12-16 19:18:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:25" (2/3) ... [2023-12-16 19:18:27,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7644d0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:18:27, skipping insertion in model container [2023-12-16 19:18:27,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:18:27" (3/3) ... [2023-12-16 19:18:27,456 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2023-12-16 19:18:27,467 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:18:27,467 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:18:27,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:18:27,503 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;@59dd4fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:18:27,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:18:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 297 states, 291 states have (on average 1.6563573883161513) internal successors, (482), 292 states have internal predecessors, (482), 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:18:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 19:18:27,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:27,517 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] [2023-12-16 19:18:27,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:27,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1078998386, now seen corresponding path program 1 times [2023-12-16 19:18:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527952311] [2023-12-16 19:18:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,837 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:18:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527952311] [2023-12-16 19:18:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527952311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:27,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 19:18:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569152968] [2023-12-16 19:18:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:27,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 19:18:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 19:18:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:18:27,867 INFO L87 Difference]: Start difference. First operand has 297 states, 291 states have (on average 1.6563573883161513) internal successors, (482), 292 states have internal predecessors, (482), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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:18:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:27,918 INFO L93 Difference]: Finished difference Result 540 states and 892 transitions. [2023-12-16 19:18:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 19:18:27,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 116 [2023-12-16 19:18:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:27,929 INFO L225 Difference]: With dead ends: 540 [2023-12-16 19:18:27,929 INFO L226 Difference]: Without dead ends: 295 [2023-12-16 19:18:27,931 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:18:27,935 INFO L413 NwaCegarLoop]: 482 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, 482 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:18:27,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-16 19:18:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-12-16 19:18:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 290 states have (on average 1.6448275862068966) internal successors, (477), 290 states have internal predecessors, (477), 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:18:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 483 transitions. [2023-12-16 19:18:27,980 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 483 transitions. Word has length 116 [2023-12-16 19:18:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:27,981 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 483 transitions. [2023-12-16 19:18:27,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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:18:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 483 transitions. [2023-12-16 19:18:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 19:18:27,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:27,988 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] [2023-12-16 19:18:27,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:18:27,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:27,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1359904200, now seen corresponding path program 1 times [2023-12-16 19:18:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:27,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755797519] [2023-12-16 19:18:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:27,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,612 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:18:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755797519] [2023-12-16 19:18:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755797519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683599219] [2023-12-16 19:18:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:28,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:28,619 INFO L87 Difference]: Start difference. First operand 295 states and 483 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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:18:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:28,657 INFO L93 Difference]: Finished difference Result 299 states and 487 transitions. [2023-12-16 19:18:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:28,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 116 [2023-12-16 19:18:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:28,659 INFO L225 Difference]: With dead ends: 299 [2023-12-16 19:18:28,659 INFO L226 Difference]: Without dead ends: 297 [2023-12-16 19:18:28,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:28,660 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:28,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1435 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-16 19:18:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-12-16 19:18:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.6404109589041096) internal successors, (479), 292 states have internal predecessors, (479), 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:18:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 485 transitions. [2023-12-16 19:18:28,671 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 485 transitions. Word has length 116 [2023-12-16 19:18:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:28,677 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 485 transitions. [2023-12-16 19:18:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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:18:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 485 transitions. [2023-12-16 19:18:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 19:18:28,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:28,682 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] [2023-12-16 19:18:28,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:18:28,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:28,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -790917242, now seen corresponding path program 1 times [2023-12-16 19:18:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597802393] [2023-12-16 19:18:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,995 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:18:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597802393] [2023-12-16 19:18:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597802393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720137804] [2023-12-16 19:18:28,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:28,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:28,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:29,003 INFO L87 Difference]: Start difference. First operand 297 states and 485 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 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:18:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:29,270 INFO L93 Difference]: Finished difference Result 752 states and 1222 transitions. [2023-12-16 19:18:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 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 117 [2023-12-16 19:18:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:29,272 INFO L225 Difference]: With dead ends: 752 [2023-12-16 19:18:29,272 INFO L226 Difference]: Without dead ends: 297 [2023-12-16 19:18:29,274 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:18:29,274 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 913 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:29,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1411 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-16 19:18:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-12-16 19:18:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.6369863013698631) internal successors, (478), 292 states have internal predecessors, (478), 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:18:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2023-12-16 19:18:29,284 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 117 [2023-12-16 19:18:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:29,284 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2023-12-16 19:18:29,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 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:18:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2023-12-16 19:18:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 19:18:29,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:29,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:18:29,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:18:29,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:29,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash 986526220, now seen corresponding path program 1 times [2023-12-16 19:18:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47437481] [2023-12-16 19:18:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,539 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:18:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:29,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47437481] [2023-12-16 19:18:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47437481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562772337] [2023-12-16 19:18:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:29,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:29,541 INFO L87 Difference]: Start difference. First operand 297 states and 484 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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:18:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:29,566 INFO L93 Difference]: Finished difference Result 545 states and 886 transitions. [2023-12-16 19:18:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 118 [2023-12-16 19:18:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:29,568 INFO L225 Difference]: With dead ends: 545 [2023-12-16 19:18:29,568 INFO L226 Difference]: Without dead ends: 300 [2023-12-16 19:18:29,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:29,576 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:29,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1430 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-16 19:18:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2023-12-16 19:18:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6326530612244898) internal successors, (480), 294 states have internal predecessors, (480), 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:18:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 486 transitions. [2023-12-16 19:18:29,592 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 486 transitions. Word has length 118 [2023-12-16 19:18:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:29,594 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 486 transitions. [2023-12-16 19:18:29,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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:18:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 486 transitions. [2023-12-16 19:18:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 19:18:29,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:29,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] [2023-12-16 19:18:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:18:29,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:29,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 307109852, now seen corresponding path program 1 times [2023-12-16 19:18:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824807315] [2023-12-16 19:18:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,930 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:18:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:29,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824807315] [2023-12-16 19:18:29,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824807315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:29,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:29,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:29,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781020529] [2023-12-16 19:18:29,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:29,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:29,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:29,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:29,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:29,933 INFO L87 Difference]: Start difference. First operand 299 states and 486 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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:18:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:29,979 INFO L93 Difference]: Finished difference Result 546 states and 886 transitions. [2023-12-16 19:18:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 119 [2023-12-16 19:18:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:29,980 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:29,980 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:29,981 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:18:29,981 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 396 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 928 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:18:29,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 928 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.629251700680272) internal successors, (479), 294 states have internal predecessors, (479), 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:18:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 485 transitions. [2023-12-16 19:18:29,988 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 485 transitions. Word has length 119 [2023-12-16 19:18:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:29,988 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 485 transitions. [2023-12-16 19:18:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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:18:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 485 transitions. [2023-12-16 19:18:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 19:18:29,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:29,989 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] [2023-12-16 19:18:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:18:29,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:29,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -602034372, now seen corresponding path program 1 times [2023-12-16 19:18:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:29,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758416852] [2023-12-16 19:18:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,204 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:18:30,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:30,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758416852] [2023-12-16 19:18:30,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758416852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:30,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847633012] [2023-12-16 19:18:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:30,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:30,206 INFO L87 Difference]: Start difference. First operand 299 states and 485 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 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:18:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:30,256 INFO L93 Difference]: Finished difference Result 546 states and 884 transitions. [2023-12-16 19:18:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 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 120 [2023-12-16 19:18:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:30,258 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:30,258 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:30,258 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:18:30,259 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 471 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 934 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6258503401360545) internal successors, (478), 294 states have internal predecessors, (478), 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:18:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 484 transitions. [2023-12-16 19:18:30,266 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 484 transitions. Word has length 120 [2023-12-16 19:18:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:30,267 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 484 transitions. [2023-12-16 19:18:30,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 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:18:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 484 transitions. [2023-12-16 19:18:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 19:18:30,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:30,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] [2023-12-16 19:18:30,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:18:30,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:30,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1199198390, now seen corresponding path program 1 times [2023-12-16 19:18:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417910902] [2023-12-16 19:18:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,607 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:18:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417910902] [2023-12-16 19:18:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417910902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822633938] [2023-12-16 19:18:30,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:30,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:30,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:30,609 INFO L87 Difference]: Start difference. First operand 299 states and 484 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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:18:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:30,677 INFO L93 Difference]: Finished difference Result 546 states and 882 transitions. [2023-12-16 19:18:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 121 [2023-12-16 19:18:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:30,679 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:30,679 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:30,680 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:18:30,681 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 388 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:30,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 892 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 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:18:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 483 transitions. [2023-12-16 19:18:30,689 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 483 transitions. Word has length 121 [2023-12-16 19:18:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:30,689 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 483 transitions. [2023-12-16 19:18:30,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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:18:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 483 transitions. [2023-12-16 19:18:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 19:18:30,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:30,691 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] [2023-12-16 19:18:30,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:18:30,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:30,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1836346922, now seen corresponding path program 1 times [2023-12-16 19:18:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054137330] [2023-12-16 19:18:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,897 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:18:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054137330] [2023-12-16 19:18:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054137330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711182889] [2023-12-16 19:18:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:30,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:30,899 INFO L87 Difference]: Start difference. First operand 299 states and 483 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 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:18:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:30,964 INFO L93 Difference]: Finished difference Result 546 states and 880 transitions. [2023-12-16 19:18:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 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 122 [2023-12-16 19:18:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:30,965 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:30,965 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:30,966 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:18:30,966 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 850 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 892 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.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:30,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 892 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.619047619047619) internal successors, (476), 294 states have internal predecessors, (476), 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:18:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 482 transitions. [2023-12-16 19:18:30,972 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 482 transitions. Word has length 122 [2023-12-16 19:18:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:30,972 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 482 transitions. [2023-12-16 19:18:30,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 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:18:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 482 transitions. [2023-12-16 19:18:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 19:18:30,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:30,973 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] [2023-12-16 19:18:30,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:18:30,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:30,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash 170210960, now seen corresponding path program 1 times [2023-12-16 19:18:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:30,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348424434] [2023-12-16 19:18:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:30,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,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:18:31,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:31,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348424434] [2023-12-16 19:18:31,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348424434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799557796] [2023-12-16 19:18:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:31,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:31,159 INFO L87 Difference]: Start difference. First operand 299 states and 482 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 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:18:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:31,223 INFO L93 Difference]: Finished difference Result 546 states and 878 transitions. [2023-12-16 19:18:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 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 123 [2023-12-16 19:18:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:31,225 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:31,225 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:31,225 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:18:31,226 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 465 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:31,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 898 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6156462585034013) internal successors, (475), 294 states have internal predecessors, (475), 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:18:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 481 transitions. [2023-12-16 19:18:31,231 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 481 transitions. Word has length 123 [2023-12-16 19:18:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:31,232 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 481 transitions. [2023-12-16 19:18:31,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 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:18:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 481 transitions. [2023-12-16 19:18:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 19:18:31,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:31,233 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] [2023-12-16 19:18:31,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:18:31,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:31,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -136472208, now seen corresponding path program 1 times [2023-12-16 19:18:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:31,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238453868] [2023-12-16 19:18:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,461 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:18:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238453868] [2023-12-16 19:18:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238453868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487159359] [2023-12-16 19:18:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:31,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:31,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:31,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:31,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:31,463 INFO L87 Difference]: Start difference. First operand 299 states and 481 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 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:18:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:31,534 INFO L93 Difference]: Finished difference Result 546 states and 876 transitions. [2023-12-16 19:18:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:31,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 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 124 [2023-12-16 19:18:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:31,536 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:31,536 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:31,536 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:18:31,537 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 461 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:31,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 898 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6122448979591837) internal successors, (474), 294 states have internal predecessors, (474), 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:18:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 480 transitions. [2023-12-16 19:18:31,546 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 480 transitions. Word has length 124 [2023-12-16 19:18:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:31,546 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 480 transitions. [2023-12-16 19:18:31,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 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:18:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 480 transitions. [2023-12-16 19:18:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 19:18:31,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:31,548 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] [2023-12-16 19:18:31,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:18:31,548 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:31,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash -792506006, now seen corresponding path program 1 times [2023-12-16 19:18:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063241686] [2023-12-16 19:18:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:18:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:18:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,877 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:18:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063241686] [2023-12-16 19:18:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063241686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917346736] [2023-12-16 19:18:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:31,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:31,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:31,879 INFO L87 Difference]: Start difference. First operand 299 states and 480 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:18:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:31,918 INFO L93 Difference]: Finished difference Result 546 states and 874 transitions. [2023-12-16 19:18:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 125 [2023-12-16 19:18:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:31,919 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:31,919 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:31,920 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:18:31,920 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 427 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 926 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:18:31,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 926 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6088435374149659) internal successors, (473), 294 states have internal predecessors, (473), 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:18:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 479 transitions. [2023-12-16 19:18:31,926 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 479 transitions. Word has length 125 [2023-12-16 19:18:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:31,926 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 479 transitions. [2023-12-16 19:18:31,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:18:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 479 transitions. [2023-12-16 19:18:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:18:31,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:31,927 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] [2023-12-16 19:18:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:18:31,928 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:31,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1996412576, now seen corresponding path program 1 times [2023-12-16 19:18:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206318597] [2023-12-16 19:18:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206318597] [2023-12-16 19:18:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206318597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:32,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477322079] [2023-12-16 19:18:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:32,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:32,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:32,320 INFO L87 Difference]: Start difference. First operand 299 states and 479 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:32,395 INFO L93 Difference]: Finished difference Result 546 states and 872 transitions. [2023-12-16 19:18:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:32,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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 126 [2023-12-16 19:18:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:32,397 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:32,397 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:32,397 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:18:32,397 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 381 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1330 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:18:32,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1330 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6054421768707483) internal successors, (472), 294 states have internal predecessors, (472), 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:18:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 478 transitions. [2023-12-16 19:18:32,404 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 478 transitions. Word has length 126 [2023-12-16 19:18:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:32,404 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 478 transitions. [2023-12-16 19:18:32,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 478 transitions. [2023-12-16 19:18:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:18:32,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:32,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] [2023-12-16 19:18:32,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:18:32,405 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:32,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 190974242, now seen corresponding path program 1 times [2023-12-16 19:18:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355044518] [2023-12-16 19:18:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,738 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:18:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355044518] [2023-12-16 19:18:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355044518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988323708] [2023-12-16 19:18:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:32,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:32,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:32,739 INFO L87 Difference]: Start difference. First operand 299 states and 478 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:32,807 INFO L93 Difference]: Finished difference Result 546 states and 870 transitions. [2023-12-16 19:18:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:32,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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 126 [2023-12-16 19:18:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:32,808 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:32,808 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:32,809 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:18:32,809 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 378 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:32,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 896 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6020408163265305) internal successors, (471), 294 states have internal predecessors, (471), 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:18:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 477 transitions. [2023-12-16 19:18:32,815 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 477 transitions. Word has length 126 [2023-12-16 19:18:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:32,815 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 477 transitions. [2023-12-16 19:18:32,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 477 transitions. [2023-12-16 19:18:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:18:32,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:32,816 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] [2023-12-16 19:18:32,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:18:32,817 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:32,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash -626674208, now seen corresponding path program 1 times [2023-12-16 19:18:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157626927] [2023-12-16 19:18:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,114 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:18:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157626927] [2023-12-16 19:18:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157626927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583056842] [2023-12-16 19:18:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:33,116 INFO L87 Difference]: Start difference. First operand 299 states and 477 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:33,184 INFO L93 Difference]: Finished difference Result 546 states and 868 transitions. [2023-12-16 19:18:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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 126 [2023-12-16 19:18:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:33,186 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:33,186 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:33,186 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:18:33,187 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 748 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 890 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:18:33,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 890 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.598639455782313) internal successors, (470), 294 states have internal predecessors, (470), 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:18:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 476 transitions. [2023-12-16 19:18:33,193 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 476 transitions. Word has length 126 [2023-12-16 19:18:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:33,193 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 476 transitions. [2023-12-16 19:18:33,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 476 transitions. [2023-12-16 19:18:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:18:33,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:33,194 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] [2023-12-16 19:18:33,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:18:33,194 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:33,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2079945186, now seen corresponding path program 1 times [2023-12-16 19:18:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942376705] [2023-12-16 19:18:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,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:18:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942376705] [2023-12-16 19:18:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942376705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985761391] [2023-12-16 19:18:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:33,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:33,417 INFO L87 Difference]: Start difference. First operand 299 states and 476 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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:18:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:33,455 INFO L93 Difference]: Finished difference Result 546 states and 866 transitions. [2023-12-16 19:18:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 126 [2023-12-16 19:18:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:33,457 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:33,457 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:33,457 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:18:33,457 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 421 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 920 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:18:33,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 920 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5952380952380953) internal successors, (469), 294 states have internal predecessors, (469), 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:18:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 475 transitions. [2023-12-16 19:18:33,464 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 475 transitions. Word has length 126 [2023-12-16 19:18:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:33,464 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 475 transitions. [2023-12-16 19:18:33,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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:18:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 475 transitions. [2023-12-16 19:18:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:18:33,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:33,465 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] [2023-12-16 19:18:33,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:18:33,465 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:33,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2107010788, now seen corresponding path program 1 times [2023-12-16 19:18:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:33,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900278189] [2023-12-16 19:18:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,715 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:18:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900278189] [2023-12-16 19:18:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900278189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853399166] [2023-12-16 19:18:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:33,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:33,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:33,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:33,717 INFO L87 Difference]: Start difference. First operand 299 states and 475 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:33,755 INFO L93 Difference]: Finished difference Result 546 states and 864 transitions. [2023-12-16 19:18:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:33,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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 126 [2023-12-16 19:18:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:33,756 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:18:33,757 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:18:33,757 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:18:33,757 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 382 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 910 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:18:33,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 910 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:18:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:18:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5918367346938775) internal successors, (468), 294 states have internal predecessors, (468), 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:18:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 474 transitions. [2023-12-16 19:18:33,763 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 474 transitions. Word has length 126 [2023-12-16 19:18:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:33,764 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 474 transitions. [2023-12-16 19:18:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2023-12-16 19:18:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:18:33,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:33,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] [2023-12-16 19:18:33,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:18:33,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:33,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash -801753114, now seen corresponding path program 1 times [2023-12-16 19:18:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720893302] [2023-12-16 19:18:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,353 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:18:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720893302] [2023-12-16 19:18:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720893302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:34,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:34,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:34,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124744231] [2023-12-16 19:18:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:34,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:34,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:34,355 INFO L87 Difference]: Start difference. First operand 299 states and 474 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:34,472 INFO L93 Difference]: Finished difference Result 872 states and 1373 transitions. [2023-12-16 19:18:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:18:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (3), 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 126 [2023-12-16 19:18:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:34,475 INFO L225 Difference]: With dead ends: 872 [2023-12-16 19:18:34,475 INFO L226 Difference]: Without dead ends: 625 [2023-12-16 19:18:34,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:18:34,476 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 1957 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:34,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 1972 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-16 19:18:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2023-12-16 19:18:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.566579634464752) internal successors, (600), 383 states have internal predecessors, (600), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 612 transitions. [2023-12-16 19:18:34,488 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 612 transitions. Word has length 126 [2023-12-16 19:18:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:34,488 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 612 transitions. [2023-12-16 19:18:34,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (3), 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:18:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 612 transitions. [2023-12-16 19:18:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2023-12-16 19:18:34,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:34,491 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:34,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:18:34,491 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:34,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1097460414, now seen corresponding path program 1 times [2023-12-16 19:18:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:34,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960039217] [2023-12-16 19:18:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-12-16 19:18:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:18:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-16 19:18:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960039217] [2023-12-16 19:18:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960039217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39827519] [2023-12-16 19:18:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:35,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:35,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:35,078 INFO L87 Difference]: Start difference. First operand 391 states and 612 transitions. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:35,145 INFO L93 Difference]: Finished difference Result 638 states and 1000 transitions. [2023-12-16 19:18:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 307 [2023-12-16 19:18:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:35,147 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:35,147 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:35,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:35,148 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 427 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:35,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 892 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5639686684073106) internal successors, (599), 383 states have internal predecessors, (599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 611 transitions. [2023-12-16 19:18:35,162 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 611 transitions. Word has length 307 [2023-12-16 19:18:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:35,162 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 611 transitions. [2023-12-16 19:18:35,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 611 transitions. [2023-12-16 19:18:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-12-16 19:18:35,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:35,165 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:35,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:18:35,165 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:35,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:35,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2065073014, now seen corresponding path program 1 times [2023-12-16 19:18:35,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:35,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544519091] [2023-12-16 19:18:35,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:35,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-16 19:18:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-16 19:18:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-16 19:18:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544519091] [2023-12-16 19:18:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544519091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:35,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:35,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56527203] [2023-12-16 19:18:35,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:35,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:35,693 INFO L87 Difference]: Start difference. First operand 391 states and 611 transitions. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:35,752 INFO L93 Difference]: Finished difference Result 638 states and 998 transitions. [2023-12-16 19:18:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 308 [2023-12-16 19:18:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:35,754 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:35,754 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:35,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:35,755 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 419 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:35,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 892 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5613577023498695) internal successors, (598), 383 states have internal predecessors, (598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 610 transitions. [2023-12-16 19:18:35,769 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 610 transitions. Word has length 308 [2023-12-16 19:18:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:35,769 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 610 transitions. [2023-12-16 19:18:35,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 610 transitions. [2023-12-16 19:18:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-12-16 19:18:35,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:35,772 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:35,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 19:18:35,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:35,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1940062474, now seen corresponding path program 1 times [2023-12-16 19:18:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029465073] [2023-12-16 19:18:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-16 19:18:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-16 19:18:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:18:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029465073] [2023-12-16 19:18:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029465073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567003561] [2023-12-16 19:18:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:36,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:36,263 INFO L87 Difference]: Start difference. First operand 391 states and 610 transitions. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:36,322 INFO L93 Difference]: Finished difference Result 638 states and 996 transitions. [2023-12-16 19:18:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 309 [2023-12-16 19:18:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:36,324 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:36,324 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:36,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:36,325 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 411 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:36,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 892 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.558746736292428) internal successors, (597), 383 states have internal predecessors, (597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2023-12-16 19:18:36,336 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 309 [2023-12-16 19:18:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:36,336 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2023-12-16 19:18:36,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2023-12-16 19:18:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-12-16 19:18:36,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:36,339 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:36,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 19:18:36,339 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:36,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash 754025766, now seen corresponding path program 1 times [2023-12-16 19:18:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:36,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62125311] [2023-12-16 19:18:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:36,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-16 19:18:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-16 19:18:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-16 19:18:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62125311] [2023-12-16 19:18:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62125311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:36,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114280146] [2023-12-16 19:18:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:36,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:36,854 INFO L87 Difference]: Start difference. First operand 391 states and 609 transitions. Second operand has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:36,912 INFO L93 Difference]: Finished difference Result 638 states and 994 transitions. [2023-12-16 19:18:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 310 [2023-12-16 19:18:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:36,914 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:36,914 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:36,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:36,915 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 717 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:36,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 886 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.556135770234987) internal successors, (596), 383 states have internal predecessors, (596), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2023-12-16 19:18:36,928 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 310 [2023-12-16 19:18:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:36,928 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2023-12-16 19:18:36,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2023-12-16 19:18:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-12-16 19:18:36,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:36,931 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 19:18:36,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:36,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1975385176, now seen corresponding path program 1 times [2023-12-16 19:18:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278738121] [2023-12-16 19:18:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-12-16 19:18:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-16 19:18:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:18:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:37,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:37,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278738121] [2023-12-16 19:18:37,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278738121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:37,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:37,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098020616] [2023-12-16 19:18:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:37,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:37,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:37,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:37,389 INFO L87 Difference]: Start difference. First operand 391 states and 608 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:37,437 INFO L93 Difference]: Finished difference Result 638 states and 992 transitions. [2023-12-16 19:18:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 311 [2023-12-16 19:18:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:37,439 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:37,439 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:37,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:37,440 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 389 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:37,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 908 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5535248041775458) internal successors, (595), 383 states have internal predecessors, (595), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2023-12-16 19:18:37,451 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 311 [2023-12-16 19:18:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:37,451 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2023-12-16 19:18:37,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2023-12-16 19:18:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-16 19:18:37,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:37,454 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 19:18:37,454 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:37,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -347143784, now seen corresponding path program 1 times [2023-12-16 19:18:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:37,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21353201] [2023-12-16 19:18:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-16 19:18:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-16 19:18:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-16 19:18:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21353201] [2023-12-16 19:18:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21353201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904204441] [2023-12-16 19:18:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:37,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:37,936 INFO L87 Difference]: Start difference. First operand 391 states and 607 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:37,980 INFO L93 Difference]: Finished difference Result 638 states and 990 transitions. [2023-12-16 19:18:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 312 [2023-12-16 19:18:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:37,982 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:37,982 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:37,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:37,983 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 381 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:37,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 908 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5509138381201044) internal successors, (594), 383 states have internal predecessors, (594), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 606 transitions. [2023-12-16 19:18:37,995 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 606 transitions. Word has length 312 [2023-12-16 19:18:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:37,995 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 606 transitions. [2023-12-16 19:18:37,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 606 transitions. [2023-12-16 19:18:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-12-16 19:18:37,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:37,998 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 19:18:37,998 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:37,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1536704732, now seen corresponding path program 1 times [2023-12-16 19:18:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138699934] [2023-12-16 19:18:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-16 19:18:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-16 19:18:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-12-16 19:18:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138699934] [2023-12-16 19:18:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138699934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:38,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177505894] [2023-12-16 19:18:38,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:38,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:38,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:38,586 INFO L87 Difference]: Start difference. First operand 391 states and 606 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:38,786 INFO L93 Difference]: Finished difference Result 638 states and 988 transitions. [2023-12-16 19:18:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 313 [2023-12-16 19:18:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:38,789 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:38,789 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:38,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:18:38,790 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 370 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 680 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:18:38,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 680 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5483028720626633) internal successors, (593), 383 states have internal predecessors, (593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 605 transitions. [2023-12-16 19:18:38,805 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 605 transitions. Word has length 313 [2023-12-16 19:18:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:38,805 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 605 transitions. [2023-12-16 19:18:38,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 605 transitions. [2023-12-16 19:18:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-16 19:18:38,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:38,809 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:38,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 19:18:38,809 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:38,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1495233592, now seen corresponding path program 1 times [2023-12-16 19:18:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339470480] [2023-12-16 19:18:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-16 19:18:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-16 19:18:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-16 19:18:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339470480] [2023-12-16 19:18:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339470480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:39,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688138314] [2023-12-16 19:18:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:39,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:39,838 INFO L87 Difference]: Start difference. First operand 391 states and 605 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:39,906 INFO L93 Difference]: Finished difference Result 638 states and 986 transitions. [2023-12-16 19:18:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 314 [2023-12-16 19:18:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:39,908 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:39,908 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:39,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:18:39,910 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 367 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:39,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 886 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5456919060052219) internal successors, (592), 383 states have internal predecessors, (592), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 604 transitions. [2023-12-16 19:18:39,929 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 604 transitions. Word has length 314 [2023-12-16 19:18:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:39,929 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 604 transitions. [2023-12-16 19:18:39,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 604 transitions. [2023-12-16 19:18:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-16 19:18:39,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:39,932 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:39,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 19:18:39,932 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:39,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -91364406, now seen corresponding path program 1 times [2023-12-16 19:18:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890453533] [2023-12-16 19:18:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:40,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-16 19:18:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-16 19:18:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-16 19:18:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890453533] [2023-12-16 19:18:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890453533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880435672] [2023-12-16 19:18:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:41,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:41,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:41,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:41,012 INFO L87 Difference]: Start difference. First operand 391 states and 604 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:41,072 INFO L93 Difference]: Finished difference Result 638 states and 984 transitions. [2023-12-16 19:18:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 314 [2023-12-16 19:18:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:41,074 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:18:41,074 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:41,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:18:41,075 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 310 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:41,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 880 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5430809399477807) internal successors, (591), 383 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 603 transitions. [2023-12-16 19:18:41,089 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 603 transitions. Word has length 314 [2023-12-16 19:18:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:41,089 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 603 transitions. [2023-12-16 19:18:41,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 603 transitions. [2023-12-16 19:18:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-16 19:18:41,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:41,092 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 19:18:41,092 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:41,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash -702633464, now seen corresponding path program 1 times [2023-12-16 19:18:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:41,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769072509] [2023-12-16 19:18:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-16 19:18:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-16 19:18:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-16 19:18:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-16 19:18:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769072509] [2023-12-16 19:18:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769072509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:42,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:42,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858458228] [2023-12-16 19:18:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:42,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:42,170 INFO L87 Difference]: Start difference. First operand 391 states and 603 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:42,301 INFO L93 Difference]: Finished difference Result 669 states and 1020 transitions. [2023-12-16 19:18:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:18:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 314 [2023-12-16 19:18:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:42,303 INFO L225 Difference]: With dead ends: 669 [2023-12-16 19:18:42,303 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:18:42,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:18:42,304 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 4 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:42,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1251 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:18:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:18:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5378590078328982) internal successors, (589), 383 states have internal predecessors, (589), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 601 transitions. [2023-12-16 19:18:42,315 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 601 transitions. Word has length 314 [2023-12-16 19:18:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:42,315 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 601 transitions. [2023-12-16 19:18:42,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 601 transitions. [2023-12-16 19:18:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-16 19:18:42,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:42,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:42,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 19:18:42,318 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:42,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1271527428, now seen corresponding path program 1 times [2023-12-16 19:18:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858044052] [2023-12-16 19:18:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:18:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:18:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:18:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-16 19:18:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-16 19:18:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-16 19:18:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-16 19:18:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:43,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858044052] [2023-12-16 19:18:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858044052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:43,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:18:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259152282] [2023-12-16 19:18:43,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:43,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:18:43,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:43,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:18:43,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:18:43,411 INFO L87 Difference]: Start difference. First operand 391 states and 601 transitions. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:43,708 INFO L93 Difference]: Finished difference Result 830 states and 1270 transitions. [2023-12-16 19:18:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:18:43,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 316 [2023-12-16 19:18:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:43,710 INFO L225 Difference]: With dead ends: 830 [2023-12-16 19:18:43,710 INFO L226 Difference]: Without dead ends: 399 [2023-12-16 19:18:43,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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:18:43,711 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 952 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:43,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1759 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-16 19:18:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2023-12-16 19:18:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 387 states have (on average 1.5271317829457365) internal successors, (591), 387 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 19:18:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 603 transitions. [2023-12-16 19:18:43,725 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 603 transitions. Word has length 316 [2023-12-16 19:18:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:43,725 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 603 transitions. [2023-12-16 19:18:43,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 603 transitions. [2023-12-16 19:18:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-12-16 19:18:43,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:43,728 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:43,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 19:18:43,728 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:43,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash -84980268, now seen corresponding path program 1 times [2023-12-16 19:18:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031541380] [2023-12-16 19:18:43,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:18:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-12-16 19:18:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-16 19:18:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-16 19:18:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031541380] [2023-12-16 19:18:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031541380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45544728] [2023-12-16 19:18:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:44,673 INFO L87 Difference]: Start difference. First operand 395 states and 603 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:44,989 INFO L93 Difference]: Finished difference Result 967 states and 1479 transitions. [2023-12-16 19:18:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:44,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 318 [2023-12-16 19:18:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:44,992 INFO L225 Difference]: With dead ends: 967 [2023-12-16 19:18:44,993 INFO L226 Difference]: Without dead ends: 718 [2023-12-16 19:18:44,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:18:44,994 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 518 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:44,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1674 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:18:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-16 19:18:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 610. [2023-12-16 19:18:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 599 states have (on average 1.5208681135225375) internal successors, (911), 599 states have internal predecessors, (911), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 19:18:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 929 transitions. [2023-12-16 19:18:45,012 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 929 transitions. Word has length 318 [2023-12-16 19:18:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:45,012 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 929 transitions. [2023-12-16 19:18:45,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 929 transitions. [2023-12-16 19:18:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-16 19:18:45,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:45,015 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:45,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 19:18:45,015 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:45,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash 964437772, now seen corresponding path program 1 times [2023-12-16 19:18:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:45,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330401782] [2023-12-16 19:18:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:18:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-16 19:18:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-16 19:18:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-16 19:18:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:46,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330401782] [2023-12-16 19:18:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330401782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615259543] [2023-12-16 19:18:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:46,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:46,057 INFO L87 Difference]: Start difference. First operand 610 states and 929 transitions. Second operand has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:46,518 INFO L93 Difference]: Finished difference Result 897 states and 1371 transitions. [2023-12-16 19:18:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 319 [2023-12-16 19:18:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:46,520 INFO L225 Difference]: With dead ends: 897 [2023-12-16 19:18:46,520 INFO L226 Difference]: Without dead ends: 648 [2023-12-16 19:18:46,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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:18:46,521 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 648 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:46,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1330 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:18:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-12-16 19:18:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 611. [2023-12-16 19:18:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 600 states have (on average 1.52) internal successors, (912), 600 states have internal predecessors, (912), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 19:18:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 930 transitions. [2023-12-16 19:18:46,553 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 930 transitions. Word has length 319 [2023-12-16 19:18:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:46,554 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 930 transitions. [2023-12-16 19:18:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 930 transitions. [2023-12-16 19:18:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-16 19:18:46,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:46,556 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 19:18:46,556 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:46,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash -317734514, now seen corresponding path program 1 times [2023-12-16 19:18:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17972869] [2023-12-16 19:18:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:46,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:18:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-16 19:18:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-16 19:18:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-16 19:18:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 19:18:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17972869] [2023-12-16 19:18:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17972869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:47,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978319667] [2023-12-16 19:18:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:47,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:47,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:47,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:47,554 INFO L87 Difference]: Start difference. First operand 611 states and 930 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:47,729 INFO L93 Difference]: Finished difference Result 1024 states and 1544 transitions. [2023-12-16 19:18:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 319 [2023-12-16 19:18:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:47,732 INFO L225 Difference]: With dead ends: 1024 [2023-12-16 19:18:47,732 INFO L226 Difference]: Without dead ends: 611 [2023-12-16 19:18:47,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:47,733 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 371 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:47,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 682 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2023-12-16 19:18:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2023-12-16 19:18:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 600 states have (on average 1.515) internal successors, (909), 600 states have internal predecessors, (909), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 19:18:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 927 transitions. [2023-12-16 19:18:47,758 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 927 transitions. Word has length 319 [2023-12-16 19:18:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:47,758 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 927 transitions. [2023-12-16 19:18:47,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 927 transitions. [2023-12-16 19:18:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-16 19:18:47,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:47,761 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 19:18:47,762 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:47,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash -270665394, now seen corresponding path program 1 times [2023-12-16 19:18:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:47,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033481153] [2023-12-16 19:18:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:18:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-16 19:18:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-16 19:18:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-16 19:18:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-16 19:18:48,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:48,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033481153] [2023-12-16 19:18:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033481153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:48,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:18:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76359680] [2023-12-16 19:18:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:48,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:18:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:18:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:18:48,934 INFO L87 Difference]: Start difference. First operand 611 states and 927 transitions. Second operand has 8 states, 8 states have (on average 33.375) internal successors, (267), 8 states have internal predecessors, (267), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:49,550 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2023-12-16 19:18:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:18:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.375) internal successors, (267), 8 states have internal predecessors, (267), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 319 [2023-12-16 19:18:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:49,555 INFO L225 Difference]: With dead ends: 1543 [2023-12-16 19:18:49,555 INFO L226 Difference]: Without dead ends: 1136 [2023-12-16 19:18:49,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-16 19:18:49,557 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 1441 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:49,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 1866 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 19:18:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-16 19:18:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1129. [2023-12-16 19:18:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1109 states have (on average 1.5085662759242562) internal successors, (1673), 1109 states have internal predecessors, (1673), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 19:18:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1709 transitions. [2023-12-16 19:18:49,586 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1709 transitions. Word has length 319 [2023-12-16 19:18:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:49,587 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1709 transitions. [2023-12-16 19:18:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.375) internal successors, (267), 8 states have internal predecessors, (267), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1709 transitions. [2023-12-16 19:18:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-16 19:18:49,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:49,589 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 19:18:49,590 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:49,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1346315890, now seen corresponding path program 1 times [2023-12-16 19:18:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133606605] [2023-12-16 19:18:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:18:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-16 19:18:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-16 19:18:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-16 19:18:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-16 19:18:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:50,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133606605] [2023-12-16 19:18:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133606605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:18:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570265581] [2023-12-16 19:18:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:18:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:18:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:18:50,474 INFO L87 Difference]: Start difference. First operand 1129 states and 1709 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 19:18:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:50,887 INFO L93 Difference]: Finished difference Result 2146 states and 3242 transitions. [2023-12-16 19:18:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 319 [2023-12-16 19:18:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:50,890 INFO L225 Difference]: With dead ends: 2146 [2023-12-16 19:18:50,890 INFO L226 Difference]: Without dead ends: 1153 [2023-12-16 19:18:50,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:18:50,892 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 1218 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:50,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1123 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:18:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2023-12-16 19:18:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1141. [2023-12-16 19:18:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1121 states have (on average 1.4977698483496877) internal successors, (1679), 1121 states have internal predecessors, (1679), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 19:18:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1715 transitions. [2023-12-16 19:18:50,919 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1715 transitions. Word has length 319 [2023-12-16 19:18:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:50,920 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1715 transitions. [2023-12-16 19:18:50,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 19:18:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1715 transitions. [2023-12-16 19:18:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-16 19:18:50,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:50,922 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:50,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 19:18:50,922 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:50,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1069955458, now seen corresponding path program 1 times [2023-12-16 19:18:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516342233] [2023-12-16 19:18:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 19:18:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-16 19:18:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-16 19:18:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-16 19:18:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-16 19:18:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516342233] [2023-12-16 19:18:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516342233] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:18:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578996664] [2023-12-16 19:18:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:18:52,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:18:52,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:18:52,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 19:18:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 19:18:52,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:18:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-16 19:18:52,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:18:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-16 19:18:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578996664] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 19:18:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 19:18:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 10] total 17 [2023-12-16 19:18:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198131440] [2023-12-16 19:18:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:52,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:18:52,915 INFO L87 Difference]: Start difference. First operand 1141 states and 1715 transitions. Second operand has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 19:18:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:52,966 INFO L93 Difference]: Finished difference Result 2086 states and 3128 transitions. [2023-12-16 19:18:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 321 [2023-12-16 19:18:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:52,970 INFO L225 Difference]: With dead ends: 2086 [2023-12-16 19:18:52,970 INFO L226 Difference]: Without dead ends: 1141 [2023-12-16 19:18:52,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:18:52,971 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:52,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1796 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2023-12-16 19:18:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2023-12-16 19:18:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1121 states have (on average 1.4924174843889384) internal successors, (1673), 1121 states have internal predecessors, (1673), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 19:18:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1709 transitions. [2023-12-16 19:18:53,000 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1709 transitions. Word has length 321 [2023-12-16 19:18:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:53,000 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1709 transitions. [2023-12-16 19:18:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 19:18:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1709 transitions. [2023-12-16 19:18:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:18:53,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:53,004 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:53,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 19:18:53,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-16 19:18:53,213 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:53,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1380297678, now seen corresponding path program 1 times [2023-12-16 19:18:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996219005] [2023-12-16 19:18:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:18:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:18:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:18:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-12-16 19:18:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996219005] [2023-12-16 19:18:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996219005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:54,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102816182] [2023-12-16 19:18:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:54,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:54,195 INFO L87 Difference]: Start difference. First operand 1141 states and 1709 transitions. Second operand has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 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:18:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:54,496 INFO L93 Difference]: Finished difference Result 1150 states and 1716 transitions. [2023-12-16 19:18:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:54,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 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 323 [2023-12-16 19:18:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:54,498 INFO L225 Difference]: With dead ends: 1150 [2023-12-16 19:18:54,499 INFO L226 Difference]: Without dead ends: 623 [2023-12-16 19:18:54,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:18:54,500 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 779 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:54,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1065 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:18:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-16 19:18:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2023-12-16 19:18:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 609 states have (on average 1.4975369458128078) internal successors, (912), 609 states have internal predecessors, (912), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 19:18:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 930 transitions. [2023-12-16 19:18:54,515 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 930 transitions. Word has length 323 [2023-12-16 19:18:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:54,515 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 930 transitions. [2023-12-16 19:18:54,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 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:18:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 930 transitions. [2023-12-16 19:18:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:18:54,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:54,517 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 19:18:54,517 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:54,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -319335346, now seen corresponding path program 1 times [2023-12-16 19:18:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526495541] [2023-12-16 19:18:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:18:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:18:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:18:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:55,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526495541] [2023-12-16 19:18:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526495541] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:18:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112409293] [2023-12-16 19:18:55,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:55,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:18:55,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:18:55,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:18:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 19:18:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 2083 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 19:18:56,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:18:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-12-16 19:18:56,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 19:18:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112409293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:56,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 19:18:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-16 19:18:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399491222] [2023-12-16 19:18:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:56,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:18:56,218 INFO L87 Difference]: Start difference. First operand 620 states and 930 transitions. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 19:18:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:56,491 INFO L93 Difference]: Finished difference Result 1122 states and 1679 transitions. [2023-12-16 19:18:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:56,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 323 [2023-12-16 19:18:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:56,493 INFO L225 Difference]: With dead ends: 1122 [2023-12-16 19:18:56,493 INFO L226 Difference]: Without dead ends: 626 [2023-12-16 19:18:56,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-16 19:18:56,495 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 764 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:56,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1102 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-12-16 19:18:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 623. [2023-12-16 19:18:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 612 states have (on average 1.4950980392156863) internal successors, (915), 612 states have internal predecessors, (915), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 19:18:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 933 transitions. [2023-12-16 19:18:56,509 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 933 transitions. Word has length 323 [2023-12-16 19:18:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:56,509 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 933 transitions. [2023-12-16 19:18:56,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 19:18:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 933 transitions. [2023-12-16 19:18:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:18:56,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:56,511 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:56,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-16 19:18:56,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-16 19:18:56,721 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:56,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1847704434, now seen corresponding path program 1 times [2023-12-16 19:18:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113441265] [2023-12-16 19:18:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:18:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:18:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:18:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:18:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-16 19:18:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:58,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113441265] [2023-12-16 19:18:58,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113441265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:58,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:18:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760120628] [2023-12-16 19:18:58,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:58,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:18:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:58,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:18:58,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:18:58,213 INFO L87 Difference]: Start difference. First operand 623 states and 933 transitions. Second operand has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 19:18:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:59,672 INFO L93 Difference]: Finished difference Result 1970 states and 2940 transitions. [2023-12-16 19:18:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 19:18:59,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 323 [2023-12-16 19:18:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:59,676 INFO L225 Difference]: With dead ends: 1970 [2023-12-16 19:18:59,677 INFO L226 Difference]: Without dead ends: 1529 [2023-12-16 19:18:59,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-16 19:18:59,678 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 1448 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:59,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 2295 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 19:18:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2023-12-16 19:18:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 695. [2023-12-16 19:18:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 681 states have (on average 1.497797356828194) internal successors, (1020), 681 states have internal predecessors, (1020), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 19:18:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1044 transitions. [2023-12-16 19:18:59,707 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1044 transitions. Word has length 323 [2023-12-16 19:18:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:59,708 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1044 transitions. [2023-12-16 19:18:59,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 19:18:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1044 transitions. [2023-12-16 19:18:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-12-16 19:18:59,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:59,710 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:59,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 19:18:59,710 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:59,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 705959442, now seen corresponding path program 1 times [2023-12-16 19:18:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930626835] [2023-12-16 19:18:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-16 19:19:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-16 19:19:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-12-16 19:19:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 19:19:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930626835] [2023-12-16 19:19:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930626835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:00,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197626317] [2023-12-16 19:19:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:00,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:00,781 INFO L87 Difference]: Start difference. First operand 695 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:00,856 INFO L93 Difference]: Finished difference Result 1593 states and 2369 transitions. [2023-12-16 19:19:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:19:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2023-12-16 19:19:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:00,861 INFO L225 Difference]: With dead ends: 1593 [2023-12-16 19:19:00,861 INFO L226 Difference]: Without dead ends: 1206 [2023-12-16 19:19:00,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:00,865 INFO L413 NwaCegarLoop]: 811 mSDtfsCounter, 728 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2560 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:00,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2560 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2023-12-16 19:19:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 791. [2023-12-16 19:19:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 777 states have (on average 1.4633204633204633) internal successors, (1137), 777 states have internal predecessors, (1137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 19:19:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1161 transitions. [2023-12-16 19:19:00,894 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1161 transitions. Word has length 325 [2023-12-16 19:19:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:00,895 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1161 transitions. [2023-12-16 19:19:00,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1161 transitions. [2023-12-16 19:19:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:00,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:00,897 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 19:19:00,897 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:00,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1060305266, now seen corresponding path program 1 times [2023-12-16 19:19:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606201285] [2023-12-16 19:19:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-16 19:19:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606201285] [2023-12-16 19:19:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606201285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:01,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128276007] [2023-12-16 19:19:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:01,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:01,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:01,327 INFO L87 Difference]: Start difference. First operand 791 states and 1161 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:01,382 INFO L93 Difference]: Finished difference Result 1812 states and 2668 transitions. [2023-12-16 19:19:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:19:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2023-12-16 19:19:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:01,386 INFO L225 Difference]: With dead ends: 1812 [2023-12-16 19:19:01,386 INFO L226 Difference]: Without dead ends: 1325 [2023-12-16 19:19:01,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:01,387 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 724 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:01,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1991 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2023-12-16 19:19:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 857. [2023-12-16 19:19:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 843 states have (on average 1.4697508896797153) internal successors, (1239), 843 states have internal predecessors, (1239), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 19:19:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1263 transitions. [2023-12-16 19:19:01,414 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1263 transitions. Word has length 327 [2023-12-16 19:19:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:01,414 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1263 transitions. [2023-12-16 19:19:01,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1263 transitions. [2023-12-16 19:19:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:01,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:01,416 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 19:19:01,417 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:01,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash -64243890, now seen corresponding path program 1 times [2023-12-16 19:19:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368473089] [2023-12-16 19:19:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368473089] [2023-12-16 19:19:02,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368473089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:02,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:02,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:19:02,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158044245] [2023-12-16 19:19:02,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:02,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:19:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:19:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:19:02,958 INFO L87 Difference]: Start difference. First operand 857 states and 1263 transitions. Second operand has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 19:19:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:04,044 INFO L93 Difference]: Finished difference Result 2932 states and 4281 transitions. [2023-12-16 19:19:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 19:19:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 327 [2023-12-16 19:19:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:04,051 INFO L225 Difference]: With dead ends: 2932 [2023-12-16 19:19:04,051 INFO L226 Difference]: Without dead ends: 2520 [2023-12-16 19:19:04,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:19:04,052 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1443 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:04,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3209 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 19:19:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2023-12-16 19:19:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1151. [2023-12-16 19:19:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1137 states have (on average 1.4371152154793316) internal successors, (1634), 1137 states have internal predecessors, (1634), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 19:19:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1658 transitions. [2023-12-16 19:19:04,084 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1658 transitions. Word has length 327 [2023-12-16 19:19:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:04,084 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1658 transitions. [2023-12-16 19:19:04,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 19:19:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1658 transitions. [2023-12-16 19:19:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:04,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:04,088 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-16 19:19:04,088 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:04,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1021181660, now seen corresponding path program 1 times [2023-12-16 19:19:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225311065] [2023-12-16 19:19:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-16 19:19:04,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225311065] [2023-12-16 19:19:04,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225311065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:04,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:04,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:04,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903325353] [2023-12-16 19:19:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:04,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:04,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:04,726 INFO L87 Difference]: Start difference. First operand 1151 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 19:19:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:04,767 INFO L93 Difference]: Finished difference Result 2150 states and 3082 transitions. [2023-12-16 19:19:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 327 [2023-12-16 19:19:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:04,782 INFO L225 Difference]: With dead ends: 2150 [2023-12-16 19:19:04,783 INFO L226 Difference]: Without dead ends: 1151 [2023-12-16 19:19:04,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 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:04,784 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 748 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:04,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 621 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-12-16 19:19:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2023-12-16 19:19:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1137 states have (on average 1.4318381706244503) internal successors, (1628), 1137 states have internal predecessors, (1628), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 19:19:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1652 transitions. [2023-12-16 19:19:04,810 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1652 transitions. Word has length 327 [2023-12-16 19:19:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:04,811 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1652 transitions. [2023-12-16 19:19:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 19:19:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1652 transitions. [2023-12-16 19:19:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:04,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:04,813 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-16 19:19:04,814 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:04,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1108752802, now seen corresponding path program 1 times [2023-12-16 19:19:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:04,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174732581] [2023-12-16 19:19:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-16 19:19:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174732581] [2023-12-16 19:19:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174732581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 19:19:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696797180] [2023-12-16 19:19:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:07,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:19:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:19:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:19:07,122 INFO L87 Difference]: Start difference. First operand 1151 states and 1652 transitions. Second operand has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 19:19:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:07,668 INFO L93 Difference]: Finished difference Result 2810 states and 4049 transitions. [2023-12-16 19:19:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 19:19:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 327 [2023-12-16 19:19:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:07,672 INFO L225 Difference]: With dead ends: 2810 [2023-12-16 19:19:07,673 INFO L226 Difference]: Without dead ends: 2059 [2023-12-16 19:19:07,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-16 19:19:07,674 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 2593 mSDsluCounter, 4347 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2598 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:07,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2598 Valid, 5376 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2023-12-16 19:19:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1205. [2023-12-16 19:19:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1188 states have (on average 1.4292929292929293) internal successors, (1698), 1188 states have internal predecessors, (1698), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1728 transitions. [2023-12-16 19:19:07,706 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1728 transitions. Word has length 327 [2023-12-16 19:19:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:07,706 INFO L495 AbstractCegarLoop]: Abstraction has 1205 states and 1728 transitions. [2023-12-16 19:19:07,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 19:19:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1728 transitions. [2023-12-16 19:19:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:07,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:07,709 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:07,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-16 19:19:07,709 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:07,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1346334724, now seen corresponding path program 1 times [2023-12-16 19:19:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57051452] [2023-12-16 19:19:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57051452] [2023-12-16 19:19:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57051452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:19:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068176706] [2023-12-16 19:19:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:09,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:19:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:19:09,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:19:09,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 19:19:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-16 19:19:09,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:19:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-16 19:19:10,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 19:19:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068176706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:10,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 19:19:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2023-12-16 19:19:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432281676] [2023-12-16 19:19:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:10,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:19:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:19:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-16 19:19:10,085 INFO L87 Difference]: Start difference. First operand 1205 states and 1728 transitions. Second operand has 10 states, 9 states have (on average 28.0) internal successors, (252), 10 states have internal predecessors, (252), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 19:19:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:10,573 INFO L93 Difference]: Finished difference Result 3250 states and 4654 transitions. [2023-12-16 19:19:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:19:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 28.0) internal successors, (252), 10 states have internal predecessors, (252), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 327 [2023-12-16 19:19:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:10,576 INFO L225 Difference]: With dead ends: 3250 [2023-12-16 19:19:10,576 INFO L226 Difference]: Without dead ends: 2182 [2023-12-16 19:19:10,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-12-16 19:19:10,578 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 864 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:10,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2830 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2023-12-16 19:19:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1316. [2023-12-16 19:19:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1297 states have (on average 1.4317656129529683) internal successors, (1857), 1297 states have internal predecessors, (1857), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 19:19:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1891 transitions. [2023-12-16 19:19:10,612 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1891 transitions. Word has length 327 [2023-12-16 19:19:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:10,612 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1891 transitions. [2023-12-16 19:19:10,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 28.0) internal successors, (252), 10 states have internal predecessors, (252), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 19:19:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1891 transitions. [2023-12-16 19:19:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:10,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:10,615 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:10,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 19:19:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:19:10,824 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:10,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 172559786, now seen corresponding path program 1 times [2023-12-16 19:19:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:10,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123544507] [2023-12-16 19:19:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-12-16 19:19:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123544507] [2023-12-16 19:19:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123544507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:12,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:19:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972930701] [2023-12-16 19:19:12,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:12,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:19:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:19:12,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:12,117 INFO L87 Difference]: Start difference. First operand 1316 states and 1891 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 19:19:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:12,356 INFO L93 Difference]: Finished difference Result 2545 states and 3628 transitions. [2023-12-16 19:19:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:12,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 327 [2023-12-16 19:19:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:12,358 INFO L225 Difference]: With dead ends: 2545 [2023-12-16 19:19:12,358 INFO L226 Difference]: Without dead ends: 1316 [2023-12-16 19:19:12,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:19:12,360 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 801 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:12,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1810 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-12-16 19:19:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1297. [2023-12-16 19:19:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1278 states have (on average 1.4264475743348983) internal successors, (1823), 1278 states have internal predecessors, (1823), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 19:19:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1857 transitions. [2023-12-16 19:19:12,389 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1857 transitions. Word has length 327 [2023-12-16 19:19:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:12,389 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1857 transitions. [2023-12-16 19:19:12,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 19:19:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1857 transitions. [2023-12-16 19:19:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-16 19:19:12,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:12,392 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:12,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-16 19:19:12,392 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:12,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 785436068, now seen corresponding path program 1 times [2023-12-16 19:19:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898351678] [2023-12-16 19:19:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 19:19:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 19:19:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 19:19:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-16 19:19:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-16 19:19:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898351678] [2023-12-16 19:19:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898351678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 19:19:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372936379] [2023-12-16 19:19:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:14,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:19:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:19:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:19:14,044 INFO L87 Difference]: Start difference. First operand 1297 states and 1857 transitions. Second operand has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:14,773 INFO L93 Difference]: Finished difference Result 3584 states and 5168 transitions. [2023-12-16 19:19:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:19:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2023-12-16 19:19:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:14,778 INFO L225 Difference]: With dead ends: 3584 [2023-12-16 19:19:14,778 INFO L226 Difference]: Without dead ends: 3143 [2023-12-16 19:19:14,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-12-16 19:19:14,779 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 2553 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:14,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 2569 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 19:19:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2023-12-16 19:19:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 1404. [2023-12-16 19:19:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1380 states have (on average 1.4246376811594204) internal successors, (1966), 1380 states have internal predecessors, (1966), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 19:19:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2010 transitions. [2023-12-16 19:19:14,824 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2010 transitions. Word has length 327 [2023-12-16 19:19:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:14,825 INFO L495 AbstractCegarLoop]: Abstraction has 1404 states and 2010 transitions. [2023-12-16 19:19:14,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2010 transitions. [2023-12-16 19:19:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-12-16 19:19:14,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:14,827 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:14,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-16 19:19:14,827 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:14,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1560648254, now seen corresponding path program 1 times [2023-12-16 19:19:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110943204] [2023-12-16 19:19:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-16 19:19:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-16 19:19:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-12-16 19:19:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-16 19:19:15,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110943204] [2023-12-16 19:19:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110943204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:15,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469741450] [2023-12-16 19:19:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:15,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:15,339 INFO L87 Difference]: Start difference. First operand 1404 states and 2010 transitions. Second operand has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Received shutdown request... [2023-12-16 19:19:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:15,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:15,635 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 536 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:15,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1526 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:15,636 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:19:15,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-16 19:19:15,637 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1404states) and FLOYD_HOARE automaton (currently 6 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (1344 states constructed, input type IntersectNwa). [2023-12-16 19:19:15,640 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:15,642 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:19:15,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:19:15 BoogieIcfgContainer [2023-12-16 19:19:15,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:19:15,643 INFO L158 Benchmark]: Toolchain (without parser) took 50170.14ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 157.3MB in the beginning and 615.6MB in the end (delta: -458.4MB). Peak memory consumption was 689.2MB. Max. memory is 8.0GB. [2023-12-16 19:19:15,643 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:19:15,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.35ms. Allocated memory is still 204.5MB. Free memory was 157.3MB in the beginning and 127.8MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 19:19:15,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.15ms. Allocated memory is still 204.5MB. Free memory was 127.8MB in the beginning and 99.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 19:19:15,643 INFO L158 Benchmark]: Boogie Preprocessor took 208.13ms. Allocated memory is still 204.5MB. Free memory was 99.0MB in the beginning and 154.5MB in the end (delta: -55.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 19:19:15,644 INFO L158 Benchmark]: RCFGBuilder took 1239.93ms. Allocated memory was 204.5MB in the beginning and 298.8MB in the end (delta: 94.4MB). Free memory was 154.5MB in the beginning and 220.9MB in the end (delta: -66.4MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. [2023-12-16 19:19:15,644 INFO L158 Benchmark]: TraceAbstraction took 48191.24ms. Allocated memory was 298.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 220.3MB in the beginning and 615.6MB in the end (delta: -395.3MB). Peak memory consumption was 656.4MB. Max. memory is 8.0GB. [2023-12-16 19:19:15,646 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 19:19:15,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 395.35ms. Allocated memory is still 204.5MB. Free memory was 157.3MB in the beginning and 127.8MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 129.15ms. Allocated memory is still 204.5MB. Free memory was 127.8MB in the beginning and 99.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 208.13ms. Allocated memory is still 204.5MB. Free memory was 99.0MB in the beginning and 154.5MB in the end (delta: -55.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1239.93ms. Allocated memory was 204.5MB in the beginning and 298.8MB in the end (delta: 94.4MB). Free memory was 154.5MB in the beginning and 220.9MB in the end (delta: -66.4MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. * TraceAbstraction took 48191.24ms. Allocated memory was 298.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 220.3MB in the beginning and 615.6MB in the end (delta: -395.3MB). Peak memory consumption was 656.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 22). Cancelled while NwaCegarLoop was constructing difference of abstraction (1404states) and FLOYD_HOARE automaton (currently 6 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (1344 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 297 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.2s, OverallIterations: 46, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31636 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31564 mSDsluCounter, 64303 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42910 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10695 IncrementalHoareTripleChecker+Invalid, 10873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 21393 mSDtfsCounter, 10695 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2080 GetRequests, 1801 SyntacticMatches, 2 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1404occurred in iteration=45, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 45 MinimizatonAttempts, 6973 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 12302 NumberOfCodeBlocks, 12302 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 12573 ConstructedInterpolants, 0 QuantifiedInterpolants, 46255 SizeOfPredicates, 14 NumberOfNonLiveVariables, 6256 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 50 InterpolantComputations, 46 PerfectInterpolantSequences, 4663/4776 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown