/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:19:23,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:19:23,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:19:23,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:19:23,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:19:24,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:19:24,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:19:24,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:19:24,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:19:24,010 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:19:24,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:19:24,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:19:24,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:19:24,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:19:24,012 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:19:24,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:19:24,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:19:24,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:19:24,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:19:24,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:19:24,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:19:24,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:19:24,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:19:24,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:19:24,017 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:19:24,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:19:24,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:19:24,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:19:24,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:19:24,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:24,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:19:24,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:19:24,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:19:24,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:19:24,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:19:24,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:19:24,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:19:24,020 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:19:24,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:19:24,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:19:24,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-16 19:19:24,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:19:24,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:19:24,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:19:24,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:19:24,239 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:19:24,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-12-16 19:19:25,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:19:25,651 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:19:25,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-12-16 19:19:25,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5203f702c/3b5c64a8a1a846b98a900990df5f72dc/FLAG41a646253 [2023-12-16 19:19:25,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5203f702c/3b5c64a8a1a846b98a900990df5f72dc [2023-12-16 19:19:25,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:19:25,685 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:19:25,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:19:25,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:19:25,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:19:25,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:25" (1/1) ... [2023-12-16 19:19:25,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6bc14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:25, skipping insertion in model container [2023-12-16 19:19:25,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:25" (1/1) ... [2023-12-16 19:19:25,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:19:25,875 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2023-12-16 19:19:26,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:19:26,069 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:19:26,079 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2023-12-16 19:19:26,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:19:26,204 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:19:26,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26 WrapperNode [2023-12-16 19:19:26,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:19:26,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:26,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:19:26,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:19:26,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,398 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1535 [2023-12-16 19:19:26,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:26,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:19:26,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:19:26,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:19:26,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 19:19:26,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:19:26,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:19:26,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:19:26,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:19:26,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (1/1) ... [2023-12-16 19:19:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:26,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:19:26,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 19:19:26,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 19:19:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:19:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 19:19:26,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 19:19:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:19:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:19:26,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:19:26,861 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:19:26,863 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:19:28,081 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:19:28,147 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:19:28,149 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:19:28,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:28 BoogieIcfgContainer [2023-12-16 19:19:28,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:19:28,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:19:28,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:19:28,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:19:28,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:19:25" (1/3) ... [2023-12-16 19:19:28,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144d9ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:28, skipping insertion in model container [2023-12-16 19:19:28,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:26" (2/3) ... [2023-12-16 19:19:28,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144d9ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:28, skipping insertion in model container [2023-12-16 19:19:28,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:28" (3/3) ... [2023-12-16 19:19:28,159 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-12-16 19:19:28,175 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:19:28,176 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:19:28,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:19:28,255 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;@2626b0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:19:28,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:19:28,263 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:19:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 19:19:28,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:28,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] [2023-12-16 19:19:28,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:28,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1078998386, now seen corresponding path program 1 times [2023-12-16 19:19:28,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:28,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901326805] [2023-12-16 19:19:28,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:28,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901326805] [2023-12-16 19:19:28,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901326805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:28,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 19:19:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708696812] [2023-12-16 19:19:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:28,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 19:19:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 19:19:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:19:28,754 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:19:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:28,820 INFO L93 Difference]: Finished difference Result 540 states and 892 transitions. [2023-12-16 19:19:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 19:19:28,823 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:19:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:28,832 INFO L225 Difference]: With dead ends: 540 [2023-12-16 19:19:28,833 INFO L226 Difference]: Without dead ends: 295 [2023-12-16 19:19:28,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:19:28,839 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:19:28,840 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:19:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-16 19:19:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-12-16 19:19:28,882 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:19:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 483 transitions. [2023-12-16 19:19:28,886 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 483 transitions. Word has length 116 [2023-12-16 19:19:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:28,887 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 483 transitions. [2023-12-16 19:19:28,887 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:19:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 483 transitions. [2023-12-16 19:19:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 19:19:28,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:28,890 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:19:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:19:28,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:28,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1359904200, now seen corresponding path program 1 times [2023-12-16 19:19:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967417610] [2023-12-16 19:19:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967417610] [2023-12-16 19:19:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967417610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153085126] [2023-12-16 19:19:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:29,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:29,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:29,826 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:19:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:29,881 INFO L93 Difference]: Finished difference Result 299 states and 487 transitions. [2023-12-16 19:19:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:29,882 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:19:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:29,887 INFO L225 Difference]: With dead ends: 299 [2023-12-16 19:19:29,887 INFO L226 Difference]: Without dead ends: 297 [2023-12-16 19:19:29,887 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:19:29,889 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:19:29,890 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:19:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-16 19:19:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-12-16 19:19:29,911 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:19:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 485 transitions. [2023-12-16 19:19:29,912 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 485 transitions. Word has length 116 [2023-12-16 19:19:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:29,914 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 485 transitions. [2023-12-16 19:19:29,914 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:19:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 485 transitions. [2023-12-16 19:19:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 19:19:29,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:29,920 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:19:29,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:19:29,921 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:29,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash -790917242, now seen corresponding path program 1 times [2023-12-16 19:19:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357148469] [2023-12-16 19:19:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357148469] [2023-12-16 19:19:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357148469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:30,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009988856] [2023-12-16 19:19:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:30,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:30,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:30,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:30,333 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:19:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:30,650 INFO L93 Difference]: Finished difference Result 752 states and 1222 transitions. [2023-12-16 19:19:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:30,650 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:19:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:30,654 INFO L225 Difference]: With dead ends: 752 [2023-12-16 19:19:30,654 INFO L226 Difference]: Without dead ends: 297 [2023-12-16 19:19:30,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:30,661 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.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:30,662 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.3s Time] [2023-12-16 19:19:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-16 19:19:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-12-16 19:19:30,680 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:19:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2023-12-16 19:19:30,682 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 117 [2023-12-16 19:19:30,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:30,682 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2023-12-16 19:19:30,682 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:19:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2023-12-16 19:19:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 19:19:30,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:30,684 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:19:30,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:19:30,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:30,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 986526220, now seen corresponding path program 1 times [2023-12-16 19:19:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044336659] [2023-12-16 19:19:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044336659] [2023-12-16 19:19:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044336659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183904943] [2023-12-16 19:19:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:30,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:30,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:30,996 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:19:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:31,034 INFO L93 Difference]: Finished difference Result 545 states and 886 transitions. [2023-12-16 19:19:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:31,035 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:19:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:31,038 INFO L225 Difference]: With dead ends: 545 [2023-12-16 19:19:31,038 INFO L226 Difference]: Without dead ends: 300 [2023-12-16 19:19:31,039 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:19:31,044 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:19:31,045 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:19:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-16 19:19:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2023-12-16 19:19:31,053 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:19:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 486 transitions. [2023-12-16 19:19:31,054 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 486 transitions. Word has length 118 [2023-12-16 19:19:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:31,055 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 486 transitions. [2023-12-16 19:19:31,055 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:19:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 486 transitions. [2023-12-16 19:19:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 19:19:31,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:31,063 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:19:31,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:19:31,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:31,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash 307109852, now seen corresponding path program 1 times [2023-12-16 19:19:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:31,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251335861] [2023-12-16 19:19:31,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251335861] [2023-12-16 19:19:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251335861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456833177] [2023-12-16 19:19:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:31,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:31,548 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:19:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:31,612 INFO L93 Difference]: Finished difference Result 546 states and 886 transitions. [2023-12-16 19:19:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:31,613 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:19:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:31,615 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:31,615 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:31,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:31,616 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:19:31,616 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:19:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:31,624 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:19:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 485 transitions. [2023-12-16 19:19:31,625 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 485 transitions. Word has length 119 [2023-12-16 19:19:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:31,626 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 485 transitions. [2023-12-16 19:19:31,626 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:19:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 485 transitions. [2023-12-16 19:19:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 19:19:31,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:31,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:31,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:19:31,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:31,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash -602034372, now seen corresponding path program 1 times [2023-12-16 19:19:31,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:31,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401192298] [2023-12-16 19:19:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401192298] [2023-12-16 19:19:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401192298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702247559] [2023-12-16 19:19:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:31,922 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:19:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,001 INFO L93 Difference]: Finished difference Result 546 states and 884 transitions. [2023-12-16 19:19:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,001 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:19:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,003 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:32,003 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:32,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:32,004 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:19:32,004 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:19:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:32,010 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:19:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 484 transitions. [2023-12-16 19:19:32,012 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 484 transitions. Word has length 120 [2023-12-16 19:19:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,012 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 484 transitions. [2023-12-16 19:19:32,012 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:19:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 484 transitions. [2023-12-16 19:19:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 19:19:32,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,013 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:19:32,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:19:32,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1199198390, now seen corresponding path program 1 times [2023-12-16 19:19:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7035606] [2023-12-16 19:19:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 19:19:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 19:19:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7035606] [2023-12-16 19:19:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7035606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:32,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:32,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450833415] [2023-12-16 19:19:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:32,404 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,451 INFO L93 Difference]: Finished difference Result 546 states and 882 transitions. [2023-12-16 19:19:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,452 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), 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 121 [2023-12-16 19:19:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,454 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:32,454 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:32,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:32,455 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 431 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:32,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 934 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:32,463 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:19:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 483 transitions. [2023-12-16 19:19:32,464 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 483 transitions. Word has length 121 [2023-12-16 19:19:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,464 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 483 transitions. [2023-12-16 19:19:32,464 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 483 transitions. [2023-12-16 19:19:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 19:19:32,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,466 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:19:32,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:19:32,466 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785428, now seen corresponding path program 1 times [2023-12-16 19:19:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020314695] [2023-12-16 19:19:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020314695] [2023-12-16 19:19:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020314695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251874296] [2023-12-16 19:19:32,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:32,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:32,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:32,837 INFO L87 Difference]: Start difference. First operand 299 states and 483 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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:19:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,920 INFO L93 Difference]: Finished difference Result 546 states and 880 transitions. [2023-12-16 19:19:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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:19:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,922 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:32,922 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:32,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:32,924 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 386 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:32,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 890 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:32,934 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:19:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 482 transitions. [2023-12-16 19:19:32,935 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 482 transitions. Word has length 122 [2023-12-16 19:19:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,936 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 482 transitions. [2023-12-16 19:19:32,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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:19:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 482 transitions. [2023-12-16 19:19:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 19:19:32,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,938 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:19:32,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:19:32,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1462564768, now seen corresponding path program 1 times [2023-12-16 19:19:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667205228] [2023-12-16 19:19:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667205228] [2023-12-16 19:19:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667205228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371610460] [2023-12-16 19:19:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:33,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:33,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:33,231 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:19:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:33,319 INFO L93 Difference]: Finished difference Result 546 states and 878 transitions. [2023-12-16 19:19:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:33,319 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:19:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:33,321 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:33,321 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:33,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:33,322 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 847 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:33,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 890 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:33,330 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:19:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 481 transitions. [2023-12-16 19:19:33,331 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 481 transitions. Word has length 123 [2023-12-16 19:19:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:33,331 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 481 transitions. [2023-12-16 19:19:33,332 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:19:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 481 transitions. [2023-12-16 19:19:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 19:19:33,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:33,333 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:19:33,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:19:33,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:33,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1127444154, now seen corresponding path program 1 times [2023-12-16 19:19:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508191055] [2023-12-16 19:19:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508191055] [2023-12-16 19:19:33,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508191055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926446402] [2023-12-16 19:19:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:33,590 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:19:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:33,676 INFO L93 Difference]: Finished difference Result 546 states and 876 transitions. [2023-12-16 19:19:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:33,677 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:19:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:33,678 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:33,678 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:33,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:33,680 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 464 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:33,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 896 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:33,688 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:19:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 480 transitions. [2023-12-16 19:19:33,689 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 480 transitions. Word has length 124 [2023-12-16 19:19:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:33,689 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 480 transitions. [2023-12-16 19:19:33,690 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:19:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 480 transitions. [2023-12-16 19:19:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 19:19:33,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:33,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, 1, 1, 1] [2023-12-16 19:19:33,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:19:33,692 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:33,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1709075078, now seen corresponding path program 1 times [2023-12-16 19:19:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:33,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474120268] [2023-12-16 19:19:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474120268] [2023-12-16 19:19:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474120268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274095858] [2023-12-16 19:19:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:33,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:33,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:33,983 INFO L87 Difference]: Start difference. First operand 299 states and 480 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,071 INFO L93 Difference]: Finished difference Result 546 states and 874 transitions. [2023-12-16 19:19:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:34,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 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 125 [2023-12-16 19:19:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,073 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:34,073 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:34,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:34,074 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 831 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:34,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 890 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:34,083 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:19:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 479 transitions. [2023-12-16 19:19:34,084 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 479 transitions. Word has length 125 [2023-12-16 19:19:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,085 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 479 transitions. [2023-12-16 19:19:34,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 479 transitions. [2023-12-16 19:19:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:19:34,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,086 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:19:34,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:19:34,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1996412576, now seen corresponding path program 1 times [2023-12-16 19:19:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889895400] [2023-12-16 19:19:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889895400] [2023-12-16 19:19:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889895400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132062723] [2023-12-16 19:19:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:34,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:34,572 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:19:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,671 INFO L93 Difference]: Finished difference Result 546 states and 872 transitions. [2023-12-16 19:19:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:34,672 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:19:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,673 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:34,673 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:34,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:34,675 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 381 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:19:34,675 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:19:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:34,682 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:19:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 478 transitions. [2023-12-16 19:19:34,684 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 478 transitions. Word has length 126 [2023-12-16 19:19:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,684 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 478 transitions. [2023-12-16 19:19:34,684 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:19:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 478 transitions. [2023-12-16 19:19:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:19:34,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:34,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:19:34,686 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash 190974242, now seen corresponding path program 1 times [2023-12-16 19:19:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448253530] [2023-12-16 19:19:34,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448253530] [2023-12-16 19:19:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448253530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113238535] [2023-12-16 19:19:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:35,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:35,074 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:19:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:35,165 INFO L93 Difference]: Finished difference Result 546 states and 870 transitions. [2023-12-16 19:19:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:35,166 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:19:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:35,168 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:35,168 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:35,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:35,169 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:35,169 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.1s Time] [2023-12-16 19:19:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:35,177 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:19:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 477 transitions. [2023-12-16 19:19:35,178 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 477 transitions. Word has length 126 [2023-12-16 19:19:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:35,178 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 477 transitions. [2023-12-16 19:19:35,179 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:19:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 477 transitions. [2023-12-16 19:19:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:19:35,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:35,180 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:19:35,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:19:35,180 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:35,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:35,181 INFO L85 PathProgramCache]: Analyzing trace with hash -626674208, now seen corresponding path program 1 times [2023-12-16 19:19:35,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168157570] [2023-12-16 19:19:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168157570] [2023-12-16 19:19:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168157570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196096661] [2023-12-16 19:19:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:35,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:35,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:35,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:35,631 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:19:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:35,726 INFO L93 Difference]: Finished difference Result 546 states and 868 transitions. [2023-12-16 19:19:35,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:35,727 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:19:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:35,729 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:35,729 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:35,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:35,730 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:35,731 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.1s Time] [2023-12-16 19:19:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:35,740 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:19:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 476 transitions. [2023-12-16 19:19:35,742 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 476 transitions. Word has length 126 [2023-12-16 19:19:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:35,742 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 476 transitions. [2023-12-16 19:19:35,742 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:19:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 476 transitions. [2023-12-16 19:19:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:19:35,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:35,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:19:35,744 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:35,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2079945186, now seen corresponding path program 1 times [2023-12-16 19:19:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:35,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000621948] [2023-12-16 19:19:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000621948] [2023-12-16 19:19:36,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000621948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455668506] [2023-12-16 19:19:36,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:36,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:36,039 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:19:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,094 INFO L93 Difference]: Finished difference Result 546 states and 866 transitions. [2023-12-16 19:19:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,095 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:19:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,096 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:36,096 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:36,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,098 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:19:36,099 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:19:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:36,107 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:19:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 475 transitions. [2023-12-16 19:19:36,108 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 475 transitions. Word has length 126 [2023-12-16 19:19:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,108 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 475 transitions. [2023-12-16 19:19:36,108 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:19:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 475 transitions. [2023-12-16 19:19:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:19:36,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,110 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:19:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:19:36,110 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2107010788, now seen corresponding path program 1 times [2023-12-16 19:19:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240464161] [2023-12-16 19:19:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240464161] [2023-12-16 19:19:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240464161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282356677] [2023-12-16 19:19:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:36,431 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:19:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,482 INFO L93 Difference]: Finished difference Result 546 states and 864 transitions. [2023-12-16 19:19:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,483 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:19:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,485 INFO L225 Difference]: With dead ends: 546 [2023-12-16 19:19:36,485 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:36,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,486 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:19:36,486 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:19:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:36,495 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:19:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 474 transitions. [2023-12-16 19:19:36,496 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 474 transitions. Word has length 126 [2023-12-16 19:19:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,497 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 474 transitions. [2023-12-16 19:19:36,497 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:19:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2023-12-16 19:19:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 19:19:36,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,498 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:19:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:19:36,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash -801753114, now seen corresponding path program 1 times [2023-12-16 19:19:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829390108] [2023-12-16 19:19:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,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:19:36,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829390108] [2023-12-16 19:19:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829390108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421649308] [2023-12-16 19:19:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:36,900 INFO L87 Difference]: Start difference. First operand 299 states and 474 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:19:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:37,063 INFO L93 Difference]: Finished difference Result 548 states and 864 transitions. [2023-12-16 19:19:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:19:37,064 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:19:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:37,065 INFO L225 Difference]: With dead ends: 548 [2023-12-16 19:19:37,065 INFO L226 Difference]: Without dead ends: 299 [2023-12-16 19:19:37,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:37,066 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 4 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:37,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1277 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-16 19:19:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-16 19:19:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.58843537414966) internal successors, (467), 294 states have internal predecessors, (467), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 473 transitions. [2023-12-16 19:19:37,078 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 473 transitions. Word has length 126 [2023-12-16 19:19:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:37,078 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 473 transitions. [2023-12-16 19:19:37,078 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:19:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 473 transitions. [2023-12-16 19:19:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-16 19:19:37,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:37,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:37,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:19:37,080 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:37,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash -186832874, now seen corresponding path program 1 times [2023-12-16 19:19:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:37,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101647058] [2023-12-16 19:19:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101647058] [2023-12-16 19:19:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101647058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289637953] [2023-12-16 19:19:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:37,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:37,852 INFO L87 Difference]: Start difference. First operand 299 states and 473 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:38,007 INFO L93 Difference]: Finished difference Result 872 states and 1369 transitions. [2023-12-16 19:19:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:38,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 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 127 [2023-12-16 19:19:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:38,010 INFO L225 Difference]: With dead ends: 872 [2023-12-16 19:19:38,010 INFO L226 Difference]: Without dead ends: 625 [2023-12-16 19:19:38,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:19:38,012 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 1950 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1967 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:19:38,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1967 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-16 19:19:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2023-12-16 19:19:38,028 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:19:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 610 transitions. [2023-12-16 19:19:38,030 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 610 transitions. Word has length 127 [2023-12-16 19:19:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:38,030 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 610 transitions. [2023-12-16 19:19:38,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 610 transitions. [2023-12-16 19:19:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-12-16 19:19:38,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:38,063 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] [2023-12-16 19:19:38,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:19:38,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:38,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1486298518, now seen corresponding path program 1 times [2023-12-16 19:19:38,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:38,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969415684] [2023-12-16 19:19:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:38,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-16 19:19:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-16 19:19:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-16 19:19:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969415684] [2023-12-16 19:19:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969415684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:38,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583939993] [2023-12-16 19:19:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:38,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:38,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:38,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:38,730 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:19:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:38,815 INFO L93 Difference]: Finished difference Result 638 states and 997 transitions. [2023-12-16 19:19:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:38,816 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:19:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:38,818 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:38,818 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:38,819 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:19:38,819 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 426 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 890 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:38,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 890 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:38,835 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:19:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2023-12-16 19:19:38,837 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 309 [2023-12-16 19:19:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2023-12-16 19:19:38,837 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:19:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2023-12-16 19:19:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-12-16 19:19:38,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:38,842 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] [2023-12-16 19:19:38,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 19:19:38,842 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:38,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1863575638, now seen corresponding path program 1 times [2023-12-16 19:19:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833079786] [2023-12-16 19:19:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-16 19:19:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-16 19:19:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:19:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833079786] [2023-12-16 19:19:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833079786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:39,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:39,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:39,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357276839] [2023-12-16 19:19:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:39,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:39,508 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:19:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:39,589 INFO L93 Difference]: Finished difference Result 638 states and 995 transitions. [2023-12-16 19:19:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:39,590 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:19:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:39,594 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:39,594 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:39,595 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:19:39,595 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 418 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 890 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:39,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 890 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:39,618 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:19:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2023-12-16 19:19:39,619 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 310 [2023-12-16 19:19:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:39,620 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2023-12-16 19:19:39,620 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:19:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2023-12-16 19:19:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-12-16 19:19:39,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:39,624 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] [2023-12-16 19:19:39,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 19:19:39,624 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:39,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash 372564790, now seen corresponding path program 1 times [2023-12-16 19:19:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690223926] [2023-12-16 19:19:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-16 19:19:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-16 19:19:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-16 19:19:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:40,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690223926] [2023-12-16 19:19:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690223926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:40,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:40,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492867863] [2023-12-16 19:19:40,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:40,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:40,311 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:19:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:40,398 INFO L93 Difference]: Finished difference Result 638 states and 993 transitions. [2023-12-16 19:19:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:40,399 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:19:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:40,401 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:40,401 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:40,402 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:19:40,402 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 410 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 890 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:40,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 890 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:40,421 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:19:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2023-12-16 19:19:40,423 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 311 [2023-12-16 19:19:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2023-12-16 19:19:40,424 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:19:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2023-12-16 19:19:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-16 19:19:40,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:40,428 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] [2023-12-16 19:19:40,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 19:19:40,428 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:40,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash -342234970, now seen corresponding path program 1 times [2023-12-16 19:19:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974755715] [2023-12-16 19:19:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-12-16 19:19:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-16 19:19:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-16 19:19:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974755715] [2023-12-16 19:19:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974755715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:41,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:41,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:41,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837012143] [2023-12-16 19:19:41,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:41,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:41,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:41,051 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:19:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:41,125 INFO L93 Difference]: Finished difference Result 638 states and 991 transitions. [2023-12-16 19:19:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:41,126 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:19:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:41,127 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:41,128 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:41,129 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:19:41,130 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 714 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 884 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:19:41,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 884 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:41,142 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:19:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 606 transitions. [2023-12-16 19:19:41,145 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 606 transitions. Word has length 312 [2023-12-16 19:19:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:41,145 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 606 transitions. [2023-12-16 19:19:41,146 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:19:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 606 transitions. [2023-12-16 19:19:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-12-16 19:19:41,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:41,149 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] [2023-12-16 19:19:41,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 19:19:41,150 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:41,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1107896516, now seen corresponding path program 1 times [2023-12-16 19:19:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:41,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950331581] [2023-12-16 19:19:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:41,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-16 19:19:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-16 19:19:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-16 19:19:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:41,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950331581] [2023-12-16 19:19:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950331581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7865504] [2023-12-16 19:19:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:41,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:41,785 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:19:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:41,845 INFO L93 Difference]: Finished difference Result 638 states and 989 transitions. [2023-12-16 19:19:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:41,846 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:19:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:41,848 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:41,848 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:41,849 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:19:41,850 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 692 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 900 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:19:41,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 900 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:41,864 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:19:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 605 transitions. [2023-12-16 19:19:41,866 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 605 transitions. Word has length 313 [2023-12-16 19:19:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:41,866 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 605 transitions. [2023-12-16 19:19:41,867 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:19:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 605 transitions. [2023-12-16 19:19:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-16 19:19:41,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:41,872 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] [2023-12-16 19:19:41,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 19:19:41,872 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:41,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash 787072628, now seen corresponding path program 1 times [2023-12-16 19:19:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066622134] [2023-12-16 19:19:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-16 19:19:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-16 19:19:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-12-16 19:19:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066622134] [2023-12-16 19:19:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066622134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:42,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403038281] [2023-12-16 19:19:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:42,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:42,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:42,490 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:19:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:42,566 INFO L93 Difference]: Finished difference Result 638 states and 987 transitions. [2023-12-16 19:19:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:42,567 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:19:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:42,568 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:42,569 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:42,569 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:19:42,570 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 380 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 906 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:19:42,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 906 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:42,585 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:19:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 604 transitions. [2023-12-16 19:19:42,587 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 604 transitions. Word has length 314 [2023-12-16 19:19:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:42,588 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 604 transitions. [2023-12-16 19:19:42,588 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:19:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 604 transitions. [2023-12-16 19:19:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-12-16 19:19:42,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:42,591 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] [2023-12-16 19:19:42,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 19:19:42,592 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:42,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 624313872, now seen corresponding path program 1 times [2023-12-16 19:19:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:42,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266141874] [2023-12-16 19:19:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-16 19:19:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-16 19:19:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-16 19:19:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266141874] [2023-12-16 19:19:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266141874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155464190] [2023-12-16 19:19:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:43,264 INFO L87 Difference]: Start difference. First operand 391 states and 604 transitions. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:43,497 INFO L93 Difference]: Finished difference Result 638 states and 985 transitions. [2023-12-16 19:19:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:43,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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 315 [2023-12-16 19:19:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:43,500 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:43,500 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:43,501 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:19:43,501 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 654 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:43,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 674 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:43,526 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:19:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 603 transitions. [2023-12-16 19:19:43,528 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 603 transitions. Word has length 315 [2023-12-16 19:19:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:43,528 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 603 transitions. [2023-12-16 19:19:43,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 603 transitions. [2023-12-16 19:19:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-16 19:19:43,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:43,533 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:19:43,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 19:19:43,534 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:43,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:43,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1824240060, now seen corresponding path program 1 times [2023-12-16 19:19:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847918358] [2023-12-16 19:19:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-16 19:19:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-16 19:19:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-16 19:19:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:44,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847918358] [2023-12-16 19:19:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847918358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127239832] [2023-12-16 19:19:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:44,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:44,712 INFO L87 Difference]: Start difference. First operand 391 states and 603 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:44,799 INFO L93 Difference]: Finished difference Result 638 states and 983 transitions. [2023-12-16 19:19:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:19:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:44,803 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:44,803 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:44,804 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:19:44,804 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 365 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 884 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:19:44,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 884 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5404699738903394) internal successors, (590), 383 states have internal predecessors, (590), 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:19:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 602 transitions. [2023-12-16 19:19:44,822 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 602 transitions. Word has length 316 [2023-12-16 19:19:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:44,822 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 602 transitions. [2023-12-16 19:19:44,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 602 transitions. [2023-12-16 19:19:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-16 19:19:44,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:44,826 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:19:44,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 19:19:44,826 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:44,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1253968254, now seen corresponding path program 1 times [2023-12-16 19:19:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:44,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409467785] [2023-12-16 19:19:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-16 19:19:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-16 19:19:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-16 19:19:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:45,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409467785] [2023-12-16 19:19:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409467785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:45,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:45,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:45,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488794328] [2023-12-16 19:19:45,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:45,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:45,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:45,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:45,977 INFO L87 Difference]: Start difference. First operand 391 states and 602 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:46,052 INFO L93 Difference]: Finished difference Result 638 states and 981 transitions. [2023-12-16 19:19:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:46,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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:19:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:46,055 INFO L225 Difference]: With dead ends: 638 [2023-12-16 19:19:46,055 INFO L226 Difference]: Without dead ends: 391 [2023-12-16 19:19:46,055 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:19:46,056 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 308 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 878 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:19:46,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 878 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-16 19:19:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-16 19:19:46,074 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:19:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 601 transitions. [2023-12-16 19:19:46,075 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 601 transitions. Word has length 316 [2023-12-16 19:19:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:46,076 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 601 transitions. [2023-12-16 19:19:46,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 601 transitions. [2023-12-16 19:19:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-16 19:19:46,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:46,080 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:19:46,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 19:19:46,080 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:46,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1271527428, now seen corresponding path program 1 times [2023-12-16 19:19:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608491029] [2023-12-16 19:19:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:46,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 19:19:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 19:19:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 19:19:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-16 19:19:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-16 19:19:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-16 19:19:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,822 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:19:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608491029] [2023-12-16 19:19:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608491029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:47,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:19:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054481955] [2023-12-16 19:19:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:47,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:19:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:19:47,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:47,824 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:19:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:48,142 INFO L93 Difference]: Finished difference Result 830 states and 1270 transitions. [2023-12-16 19:19:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:48,143 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:19:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:48,144 INFO L225 Difference]: With dead ends: 830 [2023-12-16 19:19:48,145 INFO L226 Difference]: Without dead ends: 399 [2023-12-16 19:19:48,145 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:19:48,146 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:19:48,146 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:19:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-16 19:19:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2023-12-16 19:19:48,167 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:19:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 603 transitions. [2023-12-16 19:19:48,168 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 603 transitions. Word has length 316 [2023-12-16 19:19:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:48,168 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 603 transitions. [2023-12-16 19:19:48,169 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:19:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 603 transitions. [2023-12-16 19:19:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-12-16 19:19:48,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:48,173 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:19:48,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 19:19:48,173 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:48,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -84980268, now seen corresponding path program 1 times [2023-12-16 19:19:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127669451] [2023-12-16 19:19:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:19:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-12-16 19:19:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-16 19:19:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-16 19:19:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,511 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:19:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127669451] [2023-12-16 19:19:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127669451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:49,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:49,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114389569] [2023-12-16 19:19:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:49,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:49,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:49,514 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:19:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:49,953 INFO L93 Difference]: Finished difference Result 967 states and 1479 transitions. [2023-12-16 19:19:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:49,954 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:19:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:49,957 INFO L225 Difference]: With dead ends: 967 [2023-12-16 19:19:49,958 INFO L226 Difference]: Without dead ends: 718 [2023-12-16 19:19:49,959 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:19:49,960 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 311 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:49,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1923 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-16 19:19:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 610. [2023-12-16 19:19:49,983 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:19:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 929 transitions. [2023-12-16 19:19:49,986 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 929 transitions. Word has length 318 [2023-12-16 19:19:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:49,987 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 929 transitions. [2023-12-16 19:19:49,987 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:19:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 929 transitions. [2023-12-16 19:19:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-16 19:19:49,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:49,991 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:19:49,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 19:19:49,992 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:49,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 964437772, now seen corresponding path program 1 times [2023-12-16 19:19:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205235717] [2023-12-16 19:19:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:19:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-16 19:19:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-16 19:19:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-16 19:19:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:51,542 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:19:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205235717] [2023-12-16 19:19:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205235717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:51,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99216922] [2023-12-16 19:19:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:51,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:51,545 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:19:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:51,993 INFO L93 Difference]: Finished difference Result 897 states and 1371 transitions. [2023-12-16 19:19:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:51,994 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:19:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:51,997 INFO L225 Difference]: With dead ends: 897 [2023-12-16 19:19:51,997 INFO L226 Difference]: Without dead ends: 648 [2023-12-16 19:19:51,997 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:51,998 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 865 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1318 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:19:51,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1318 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-12-16 19:19:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 611. [2023-12-16 19:19:52,020 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:19:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 930 transitions. [2023-12-16 19:19:52,022 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 930 transitions. Word has length 319 [2023-12-16 19:19:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:52,022 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 930 transitions. [2023-12-16 19:19:52,023 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:19:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 930 transitions. [2023-12-16 19:19:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-16 19:19:52,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:52,027 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:19:52,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 19:19:52,027 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:52,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash -317734514, now seen corresponding path program 1 times [2023-12-16 19:19:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757712385] [2023-12-16 19:19:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 19:19:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-16 19:19:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-16 19:19:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-16 19:19:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:53,480 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:19:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757712385] [2023-12-16 19:19:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757712385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:53,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:53,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:19:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186960440] [2023-12-16 19:19:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:53,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:19:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:53,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:19:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:53,483 INFO L87 Difference]: Start difference. First operand 611 states and 930 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:19:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:53,884 INFO L93 Difference]: Finished difference Result 1122 states and 1702 transitions. [2023-12-16 19:19:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:53,885 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:19:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:53,887 INFO L225 Difference]: With dead ends: 1122 [2023-12-16 19:19:53,887 INFO L226 Difference]: Without dead ends: 623 [2023-12-16 19:19:53,888 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:19:53,888 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 815 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:53,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1130 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-16 19:19:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 617. [2023-12-16 19:19:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 606 states have (on average 1.50990099009901) internal successors, (915), 606 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:19:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 933 transitions. [2023-12-16 19:19:53,921 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 933 transitions. Word has length 319 [2023-12-16 19:19:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:53,921 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 933 transitions. [2023-12-16 19:19:53,922 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:19:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 933 transitions. [2023-12-16 19:19:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-16 19:19:53,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:53,924 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:19:53,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 19:19:53,925 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:53,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1301267710, now seen corresponding path program 1 times [2023-12-16 19:19:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284238088] [2023-12-16 19:19:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 19:19:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-16 19:19:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-16 19:19:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-16 19:19:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-16 19:19:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284238088] [2023-12-16 19:19:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284238088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:56,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:56,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:19:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677391253] [2023-12-16 19:19:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:56,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:19:56,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:19:56,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:56,414 INFO L87 Difference]: Start difference. First operand 617 states and 933 transitions. Second operand has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:57,192 INFO L93 Difference]: Finished difference Result 1731 states and 2618 transitions. [2023-12-16 19:19:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 19:19:57,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 321 [2023-12-16 19:19:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:57,197 INFO L225 Difference]: With dead ends: 1731 [2023-12-16 19:19:57,197 INFO L226 Difference]: Without dead ends: 1196 [2023-12-16 19:19:57,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-16 19:19:57,199 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 2163 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:57,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 1877 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 19:19:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-12-16 19:19:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 627. [2023-12-16 19:19:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.5016233766233766) internal successors, (925), 616 states have internal predecessors, (925), 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:19:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 943 transitions. [2023-12-16 19:19:57,228 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 943 transitions. Word has length 321 [2023-12-16 19:19:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:57,228 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 943 transitions. [2023-12-16 19:19:57,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 943 transitions. [2023-12-16 19:19:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-16 19:19:57,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:57,231 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] [2023-12-16 19:19:57,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 19:19:57,231 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:57,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 440375488, now seen corresponding path program 1 times [2023-12-16 19:19:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:57,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141040365] [2023-12-16 19:19:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:19:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 19:19:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-16 19:19:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-16 19:19:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-16 19:19:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:58,778 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:19:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141040365] [2023-12-16 19:19:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141040365] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:19:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818641160] [2023-12-16 19:19:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:58,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:19:58,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:19:58,782 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:19:58,793 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:19:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:59,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 2072 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 19:19:59,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:19:59,583 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:19:59,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:19:59,667 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:19:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818641160] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 19:19:59,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 19:19:59,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 10] total 17 [2023-12-16 19:19:59,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075850902] [2023-12-16 19:19:59,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:59,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:59,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:59,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:19:59,670 INFO L87 Difference]: Start difference. First operand 627 states and 943 transitions. Second operand has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 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:19:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:59,716 INFO L93 Difference]: Finished difference Result 1102 states and 1655 transitions. [2023-12-16 19:19:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:59,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 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:19:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:59,719 INFO L225 Difference]: With dead ends: 1102 [2023-12-16 19:19:59,720 INFO L226 Difference]: Without dead ends: 627 [2023-12-16 19:19:59,720 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:19:59,721 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1800 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:19:59,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1800 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-12-16 19:19:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2023-12-16 19:19:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.4967532467532467) internal successors, (922), 616 states have internal predecessors, (922), 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:19:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 940 transitions. [2023-12-16 19:19:59,742 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 940 transitions. Word has length 321 [2023-12-16 19:19:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:59,742 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 940 transitions. [2023-12-16 19:19:59,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 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:19:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 940 transitions. [2023-12-16 19:19:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:19:59,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:59,744 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] [2023-12-16 19:19:59,757 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:19:59,954 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,SelfDestructingSolverStorable32 [2023-12-16 19:19:59,954 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:59,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash -328816116, now seen corresponding path program 1 times [2023-12-16 19:19:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573048273] [2023-12-16 19:19:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:20:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:20:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:20:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:20:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:20:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:20:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 19:20:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573048273] [2023-12-16 19:20:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573048273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:20:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694733705] [2023-12-16 19:20:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:01,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:20:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:20:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:20:01,228 INFO L87 Difference]: Start difference. First operand 627 states and 940 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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:20:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:01,412 INFO L93 Difference]: Finished difference Result 1042 states and 1554 transitions. [2023-12-16 19:20:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:20:01,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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 323 [2023-12-16 19:20:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:01,415 INFO L225 Difference]: With dead ends: 1042 [2023-12-16 19:20:01,415 INFO L226 Difference]: Without dead ends: 627 [2023-12-16 19:20:01,416 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:20:01,416 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 367 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:01,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 680 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:20:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-12-16 19:20:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2023-12-16 19:20:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.4918831168831168) internal successors, (919), 616 states have internal predecessors, (919), 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:20:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 937 transitions. [2023-12-16 19:20:01,439 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 937 transitions. Word has length 323 [2023-12-16 19:20:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:01,439 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 937 transitions. [2023-12-16 19:20:01,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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:20:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 937 transitions. [2023-12-16 19:20:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:20:01,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:01,444 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] [2023-12-16 19:20:01,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 19:20:01,444 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:01,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash 451398220, now seen corresponding path program 1 times [2023-12-16 19:20:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347679796] [2023-12-16 19:20:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:20:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:20:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:20:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:20:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:20:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:20:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-16 19:20:02,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:02,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347679796] [2023-12-16 19:20:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347679796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:02,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:02,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:20:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769981422] [2023-12-16 19:20:02,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:02,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:20:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:20:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:20:02,776 INFO L87 Difference]: Start difference. First operand 627 states and 937 transitions. Second operand has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 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:20:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:03,469 INFO L93 Difference]: Finished difference Result 1535 states and 2290 transitions. [2023-12-16 19:20:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:20:03,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 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:20:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:03,475 INFO L225 Difference]: With dead ends: 1535 [2023-12-16 19:20:03,475 INFO L226 Difference]: Without dead ends: 1126 [2023-12-16 19:20:03,477 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:20:03,479 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 1129 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:03,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 3085 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 19:20:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-12-16 19:20:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1119. [2023-12-16 19:20:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1101 states have (on average 1.4922797456857402) internal successors, (1643), 1101 states have internal predecessors, (1643), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 19:20:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1675 transitions. [2023-12-16 19:20:03,518 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1675 transitions. Word has length 323 [2023-12-16 19:20:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:03,518 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1675 transitions. [2023-12-16 19:20:03,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 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:20:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1675 transitions. [2023-12-16 19:20:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:20:03,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:03,522 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] [2023-12-16 19:20:03,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 19:20:03,523 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:03,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash 62165516, now seen corresponding path program 1 times [2023-12-16 19:20:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590389800] [2023-12-16 19:20:03,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:20:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:20:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:20:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:20:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:20:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:20:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 61 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-16 19:20:04,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:04,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590389800] [2023-12-16 19:20:04,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590389800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:04,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110406293] [2023-12-16 19:20:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:04,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:04,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:04,810 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:20:04,812 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:20:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:05,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 2084 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 19:20:05,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 19:20:05,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 19:20:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110406293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 19:20:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-16 19:20:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521423115] [2023-12-16 19:20:05,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:20:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:20:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:20:05,534 INFO L87 Difference]: Start difference. First operand 1119 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:20:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:05,735 INFO L93 Difference]: Finished difference Result 1572 states and 2348 transitions. [2023-12-16 19:20:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2023-12-16 19:20:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:05,738 INFO L225 Difference]: With dead ends: 1572 [2023-12-16 19:20:05,738 INFO L226 Difference]: Without dead ends: 630 [2023-12-16 19:20:05,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:20:05,740 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 366 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:05,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 666 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:20:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-12-16 19:20:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2023-12-16 19:20:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 619 states have (on average 1.4846526655896608) internal successors, (919), 619 states have internal predecessors, (919), 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:20:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 937 transitions. [2023-12-16 19:20:05,763 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 937 transitions. Word has length 323 [2023-12-16 19:20:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:05,763 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 937 transitions. [2023-12-16 19:20:05,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:20:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 937 transitions. [2023-12-16 19:20:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:20:05,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:05,766 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] [2023-12-16 19:20:05,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 19:20:05,976 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:20:05,977 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:05,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1076970868, now seen corresponding path program 1 times [2023-12-16 19:20:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:05,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006861021] [2023-12-16 19:20:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 19:20:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:20:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:20:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-16 19:20:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-16 19:20:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-16 19:20:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-16 19:20:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006861021] [2023-12-16 19:20:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006861021] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134235388] [2023-12-16 19:20:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:07,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:07,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:07,185 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:20:07,202 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:20:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:07,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 2084 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 19:20:07,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-16 19:20:08,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 19:20:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134235388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 19:20:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2023-12-16 19:20:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688066496] [2023-12-16 19:20:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:08,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:20:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:20:08,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:20:08,329 INFO L87 Difference]: Start difference. First operand 630 states and 937 transitions. Second operand has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:20:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:08,790 INFO L93 Difference]: Finished difference Result 1166 states and 1729 transitions. [2023-12-16 19:20:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:20:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2023-12-16 19:20:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:08,795 INFO L225 Difference]: With dead ends: 1166 [2023-12-16 19:20:08,795 INFO L226 Difference]: Without dead ends: 636 [2023-12-16 19:20:08,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:20:08,797 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 783 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:08,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1499 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:20:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-12-16 19:20:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 627. [2023-12-16 19:20:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.4870129870129871) internal successors, (916), 616 states have internal predecessors, (916), 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:20:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 934 transitions. [2023-12-16 19:20:08,817 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 934 transitions. Word has length 323 [2023-12-16 19:20:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 934 transitions. [2023-12-16 19:20:08,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:20:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 934 transitions. [2023-12-16 19:20:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 19:20:08,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:08,820 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:20:08,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 Received shutdown request... [2023-12-16 19:20:09,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:09,032 WARN L619 AbstractCegarLoop]: Verification canceled: while executing NwaCegarLoop. [2023-12-16 19:20:09,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:20:09,037 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] [2023-12-16 19:20:09,039 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:20:09,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:20:09 BoogieIcfgContainer [2023-12-16 19:20:09,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:20:09,041 INFO L158 Benchmark]: Toolchain (without parser) took 43356.41ms. Allocated memory was 268.4MB in the beginning and 1.0GB in the end (delta: 766.5MB). Free memory was 212.6MB in the beginning and 951.9MB in the end (delta: -739.2MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2023-12-16 19:20:09,041 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory was 143.8MB in the beginning and 143.6MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:20:09,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.09ms. Allocated memory is still 268.4MB. Free memory was 212.6MB in the beginning and 182.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-16 19:20:09,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 193.59ms. Allocated memory is still 268.4MB. Free memory was 182.7MB in the beginning and 154.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-16 19:20:09,041 INFO L158 Benchmark]: Boogie Preprocessor took 190.61ms. Allocated memory is still 268.4MB. Free memory was 154.4MB in the beginning and 138.4MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 19:20:09,042 INFO L158 Benchmark]: RCFGBuilder took 1558.46ms. Allocated memory was 268.4MB in the beginning and 413.1MB in the end (delta: 144.7MB). Free memory was 138.2MB in the beginning and 301.0MB in the end (delta: -162.8MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. [2023-12-16 19:20:09,042 INFO L158 Benchmark]: TraceAbstraction took 40887.83ms. Allocated memory was 413.1MB in the beginning and 1.0GB in the end (delta: 621.8MB). Free memory was 300.3MB in the beginning and 951.9MB in the end (delta: -651.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:20:09,044 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.12ms. Allocated memory is still 196.1MB. Free memory was 143.8MB in the beginning and 143.6MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 518.09ms. Allocated memory is still 268.4MB. Free memory was 212.6MB in the beginning and 182.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 193.59ms. Allocated memory is still 268.4MB. Free memory was 182.7MB in the beginning and 154.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 190.61ms. Allocated memory is still 268.4MB. Free memory was 154.4MB in the beginning and 138.4MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * RCFGBuilder took 1558.46ms. Allocated memory was 268.4MB in the beginning and 413.1MB in the end (delta: 144.7MB). Free memory was 138.2MB in the beginning and 301.0MB in the end (delta: -162.8MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. * TraceAbstraction took 40887.83ms. Allocated memory was 413.1MB in the beginning and 1.0GB in the end (delta: 621.8MB). Free memory was 300.3MB in the beginning and 951.9MB in the end (delta: -651.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while executing NwaCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 297 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.8s, OverallIterations: 37, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21179 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21123 mSDsluCounter, 42843 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26543 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6070 IncrementalHoareTripleChecker+Invalid, 6180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 16300 mSDtfsCounter, 6070 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1866 GetRequests, 1676 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1119occurred in iteration=35, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 975 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 10.9s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 9193 NumberOfCodeBlocks, 9193 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9473 ConstructedInterpolants, 0 QuantifiedInterpolants, 38940 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6240 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 37 PerfectInterpolantSequences, 3355/3396 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 [2023-12-16 19:20:09,055 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown