/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 18:54:46,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 18:54:46,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 18:54:46,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 18:54:46,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 18:54:46,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 18:54:46,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 18:54:46,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 18:54:46,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 18:54:46,398 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 18:54:46,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 18:54:46,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 18:54:46,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 18:54:46,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 18:54:46,400 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 18:54:46,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 18:54:46,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 18:54:46,401 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 18:54:46,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 18:54:46,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 18:54:46,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 18:54:46,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 18:54:46,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 18:54:46,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 18:54:46,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 18:54:46,403 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 18:54:46,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 18:54:46,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 18:54:46,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 18:54:46,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 18:54:46,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 18:54:46,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 18:54:46,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:54:46,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 18:54:46,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 18:54:46,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 18:54:46,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 18:54:46,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 18:54:46,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 18:54:46,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 18:54:46,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 18:54:46,636 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 18:54:46,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label27.c [2023-12-15 18:54:47,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 18:54:47,983 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 18:54:47,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label27.c [2023-12-15 18:54:48,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed8c5118/16b8a8aff8aa4f79a6556e42149b5a58/FLAG6535ea455 [2023-12-15 18:54:48,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed8c5118/16b8a8aff8aa4f79a6556e42149b5a58 [2023-12-15 18:54:48,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 18:54:48,031 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 18:54:48,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 18:54:48,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 18:54:48,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 18:54:48,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:54:48" (1/1) ... [2023-12-15 18:54:48,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c8ff25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:48, skipping insertion in model container [2023-12-15 18:54:48,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:54:48" (1/1) ... [2023-12-15 18:54:48,133 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 18:54:48,352 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label27.c[6468,6481] [2023-12-15 18:54:48,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:54:48,982 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 18:54:49,005 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label27.c[6468,6481] [2023-12-15 18:54:49,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:54:49,316 INFO L206 MainTranslator]: Completed translation [2023-12-15 18:54:49,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49 WrapperNode [2023-12-15 18:54:49,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 18:54:49,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 18:54:49,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 18:54:49,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 18:54:49,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:49,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:49,775 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2023-12-15 18:54:49,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 18:54:49,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 18:54:49,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 18:54:49,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 18:54:49,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:49,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:49,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:49,991 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-15 18:54:49,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:49,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:50,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:50,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:50,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:50,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:50,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 18:54:50,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 18:54:50,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 18:54:50,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 18:54:50,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (1/1) ... [2023-12-15 18:54:50,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:54:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:54:50,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 18:54:50,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 18:54:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 18:54:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 18:54:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 18:54:50,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 18:54:50,339 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 18:54:50,341 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 18:54:54,003 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 18:54:54,055 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 18:54:54,055 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 18:54:54,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:54:54 BoogieIcfgContainer [2023-12-15 18:54:54,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 18:54:54,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 18:54:54,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 18:54:54,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 18:54:54,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 06:54:48" (1/3) ... [2023-12-15 18:54:54,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b754c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:54:54, skipping insertion in model container [2023-12-15 18:54:54,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:54:49" (2/3) ... [2023-12-15 18:54:54,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b754c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:54:54, skipping insertion in model container [2023-12-15 18:54:54,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:54:54" (3/3) ... [2023-12-15 18:54:54,061 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label27.c [2023-12-15 18:54:54,073 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 18:54:54,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 18:54:54,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 18:54:54,129 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;@5091b612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 18:54:54,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 18:54:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-15 18:54:54,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:54:54,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:54:54,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:54:54,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:54:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1017894885, now seen corresponding path program 1 times [2023-12-15 18:54:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:54:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901384687] [2023-12-15 18:54:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:54:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:54:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:54:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:54:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:54:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901384687] [2023-12-15 18:54:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901384687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:54:54,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:54:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:54:54,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476372142] [2023-12-15 18:54:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:54:54,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 18:54:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:54:54,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 18:54:54,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 18:54:54,302 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:54:54,384 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2023-12-15 18:54:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 18:54:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-15 18:54:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:54:54,404 INFO L225 Difference]: With dead ends: 2071 [2023-12-15 18:54:54,404 INFO L226 Difference]: Without dead ends: 1034 [2023-12-15 18:54:54,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 18:54:54,413 INFO L413 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:54:54,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:54:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2023-12-15 18:54:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2023-12-15 18:54:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2023-12-15 18:54:54,481 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 44 [2023-12-15 18:54:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:54:54,481 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2023-12-15 18:54:54,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2023-12-15 18:54:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-15 18:54:54,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:54:54,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:54:54,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 18:54:54,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:54:54,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:54:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1786485728, now seen corresponding path program 1 times [2023-12-15 18:54:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:54:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072410388] [2023-12-15 18:54:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:54:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:54:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:54:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:54:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:54:54,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072410388] [2023-12-15 18:54:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072410388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:54:54,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:54:54,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:54:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709419059] [2023-12-15 18:54:54,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:54:54,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:54:54,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:54:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:54:54,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:54:54,628 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:54:58,487 INFO L93 Difference]: Finished difference Result 3015 states and 5510 transitions. [2023-12-15 18:54:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:54:58,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-15 18:54:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:54:58,495 INFO L225 Difference]: With dead ends: 3015 [2023-12-15 18:54:58,495 INFO L226 Difference]: Without dead ends: 1982 [2023-12-15 18:54:58,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:54:58,497 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 1010 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-15 18:54:58,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 317 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-15 18:54:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2023-12-15 18:54:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1929. [2023-12-15 18:54:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1928 states have (on average 1.7977178423236515) internal successors, (3466), 1928 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3466 transitions. [2023-12-15 18:54:58,546 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3466 transitions. Word has length 44 [2023-12-15 18:54:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:54:58,547 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 3466 transitions. [2023-12-15 18:54:58,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:54:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3466 transitions. [2023-12-15 18:54:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 18:54:58,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:54:58,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:54:58,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 18:54:58,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:54:58,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:54:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2110678795, now seen corresponding path program 1 times [2023-12-15 18:54:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:54:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021176367] [2023-12-15 18:54:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:54:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:54:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:54:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:54:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:54:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021176367] [2023-12-15 18:54:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021176367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:54:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:54:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:54:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386684381] [2023-12-15 18:54:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:54:58,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:54:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:54:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:54:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:54:58,758 INFO L87 Difference]: Start difference. First operand 1929 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:01,736 INFO L93 Difference]: Finished difference Result 5455 states and 9916 transitions. [2023-12-15 18:55:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-15 18:55:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:01,751 INFO L225 Difference]: With dead ends: 5455 [2023-12-15 18:55:01,751 INFO L226 Difference]: Without dead ends: 3527 [2023-12-15 18:55:01,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:01,757 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:01,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1005 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-15 18:55:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2023-12-15 18:55:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3525. [2023-12-15 18:55:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3524 states have (on average 1.5672531214528944) internal successors, (5523), 3524 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5523 transitions. [2023-12-15 18:55:01,810 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5523 transitions. Word has length 109 [2023-12-15 18:55:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:01,814 INFO L495 AbstractCegarLoop]: Abstraction has 3525 states and 5523 transitions. [2023-12-15 18:55:01,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5523 transitions. [2023-12-15 18:55:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 18:55:01,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:01,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:01,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 18:55:01,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:01,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1023593318, now seen corresponding path program 1 times [2023-12-15 18:55:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:01,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947887576] [2023-12-15 18:55:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:55:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:01,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947887576] [2023-12-15 18:55:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947887576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:01,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:01,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:55:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210310443] [2023-12-15 18:55:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:01,963 INFO L87 Difference]: Start difference. First operand 3525 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:04,807 INFO L93 Difference]: Finished difference Result 10231 states and 16096 transitions. [2023-12-15 18:55:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-15 18:55:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:04,825 INFO L225 Difference]: With dead ends: 10231 [2023-12-15 18:55:04,826 INFO L226 Difference]: Without dead ends: 6707 [2023-12-15 18:55:04,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:04,832 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:04,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 848 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-15 18:55:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2023-12-15 18:55:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 6699. [2023-12-15 18:55:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 1.4131083905643476) internal successors, (9465), 6698 states have internal predecessors, (9465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9465 transitions. [2023-12-15 18:55:04,971 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9465 transitions. Word has length 115 [2023-12-15 18:55:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:04,972 INFO L495 AbstractCegarLoop]: Abstraction has 6699 states and 9465 transitions. [2023-12-15 18:55:04,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9465 transitions. [2023-12-15 18:55:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-15 18:55:04,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:04,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:04,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 18:55:04,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:04,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1522333595, now seen corresponding path program 1 times [2023-12-15 18:55:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390951287] [2023-12-15 18:55:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:55:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390951287] [2023-12-15 18:55:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390951287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:55:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056151414] [2023-12-15 18:55:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:05,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:05,117 INFO L87 Difference]: Start difference. First operand 6699 states and 9465 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:08,337 INFO L93 Difference]: Finished difference Result 17442 states and 24478 transitions. [2023-12-15 18:55:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2023-12-15 18:55:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:08,362 INFO L225 Difference]: With dead ends: 17442 [2023-12-15 18:55:08,362 INFO L226 Difference]: Without dead ends: 10744 [2023-12-15 18:55:08,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:08,370 INFO L413 NwaCegarLoop]: 832 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:08,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 963 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-15 18:55:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2023-12-15 18:55:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 10668. [2023-12-15 18:55:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3563326146057935) internal successors, (14468), 10667 states have internal predecessors, (14468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14468 transitions. [2023-12-15 18:55:08,506 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14468 transitions. Word has length 145 [2023-12-15 18:55:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:08,508 INFO L495 AbstractCegarLoop]: Abstraction has 10668 states and 14468 transitions. [2023-12-15 18:55:08,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14468 transitions. [2023-12-15 18:55:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 18:55:08,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:08,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 18:55:08,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:08,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash -249489538, now seen corresponding path program 1 times [2023-12-15 18:55:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161346813] [2023-12-15 18:55:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:55:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161346813] [2023-12-15 18:55:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161346813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:08,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:55:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250167140] [2023-12-15 18:55:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:08,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:08,763 INFO L87 Difference]: Start difference. First operand 10668 states and 14468 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:11,171 INFO L93 Difference]: Finished difference Result 20548 states and 28118 transitions. [2023-12-15 18:55:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2023-12-15 18:55:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:11,194 INFO L225 Difference]: With dead ends: 20548 [2023-12-15 18:55:11,194 INFO L226 Difference]: Without dead ends: 10668 [2023-12-15 18:55:11,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:11,204 INFO L413 NwaCegarLoop]: 1081 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:11,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1210 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-15 18:55:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2023-12-15 18:55:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 10668. [2023-12-15 18:55:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3539889378456924) internal successors, (14443), 10667 states have internal predecessors, (14443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14443 transitions. [2023-12-15 18:55:11,337 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14443 transitions. Word has length 155 [2023-12-15 18:55:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:11,338 INFO L495 AbstractCegarLoop]: Abstraction has 10668 states and 14443 transitions. [2023-12-15 18:55:11,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14443 transitions. [2023-12-15 18:55:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-15 18:55:11,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:11,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 18:55:11,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:11,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1836590104, now seen corresponding path program 1 times [2023-12-15 18:55:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917674074] [2023-12-15 18:55:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:55:11,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917674074] [2023-12-15 18:55:11,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917674074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:11,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:55:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625625186] [2023-12-15 18:55:11,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:11,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:11,435 INFO L87 Difference]: Start difference. First operand 10668 states and 14443 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:14,341 INFO L93 Difference]: Finished difference Result 29990 states and 41154 transitions. [2023-12-15 18:55:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2023-12-15 18:55:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:14,371 INFO L225 Difference]: With dead ends: 29990 [2023-12-15 18:55:14,372 INFO L226 Difference]: Without dead ends: 20110 [2023-12-15 18:55:14,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:14,384 INFO L413 NwaCegarLoop]: 1847 mSDtfsCounter, 892 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:14,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1985 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-15 18:55:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20110 states. [2023-12-15 18:55:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20110 to 19313. [2023-12-15 18:55:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19313 states, 19312 states have (on average 1.2808616404308202) internal successors, (24736), 19312 states have internal predecessors, (24736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 24736 transitions. [2023-12-15 18:55:14,703 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 24736 transitions. Word has length 169 [2023-12-15 18:55:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:14,703 INFO L495 AbstractCegarLoop]: Abstraction has 19313 states and 24736 transitions. [2023-12-15 18:55:14,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 24736 transitions. [2023-12-15 18:55:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-15 18:55:14,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:14,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:14,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 18:55:14,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:14,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash -23937511, now seen corresponding path program 1 times [2023-12-15 18:55:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854194196] [2023-12-15 18:55:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-12-15 18:55:14,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:14,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854194196] [2023-12-15 18:55:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854194196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:14,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 18:55:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898895742] [2023-12-15 18:55:14,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:14,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:14,925 INFO L87 Difference]: Start difference. First operand 19313 states and 24736 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:17,773 INFO L93 Difference]: Finished difference Result 44941 states and 56954 transitions. [2023-12-15 18:55:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:17,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2023-12-15 18:55:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:17,809 INFO L225 Difference]: With dead ends: 44941 [2023-12-15 18:55:17,809 INFO L226 Difference]: Without dead ends: 25629 [2023-12-15 18:55:17,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:17,828 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 726 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:17,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1189 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-15 18:55:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25629 states. [2023-12-15 18:55:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25629 to 25621. [2023-12-15 18:55:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25621 states, 25620 states have (on average 1.2324746291959408) internal successors, (31576), 25620 states have internal predecessors, (31576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25621 states to 25621 states and 31576 transitions. [2023-12-15 18:55:18,097 INFO L78 Accepts]: Start accepts. Automaton has 25621 states and 31576 transitions. Word has length 256 [2023-12-15 18:55:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:18,097 INFO L495 AbstractCegarLoop]: Abstraction has 25621 states and 31576 transitions. [2023-12-15 18:55:18,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25621 states and 31576 transitions. [2023-12-15 18:55:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2023-12-15 18:55:18,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:18,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:18,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 18:55:18,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:18,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1248951905, now seen corresponding path program 1 times [2023-12-15 18:55:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761084746] [2023-12-15 18:55:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:18,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:55:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:18,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761084746] [2023-12-15 18:55:18,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761084746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:18,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:55:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753098902] [2023-12-15 18:55:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:18,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:18,311 INFO L87 Difference]: Start difference. First operand 25621 states and 31576 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:21,403 INFO L93 Difference]: Finished difference Result 72508 states and 89960 transitions. [2023-12-15 18:55:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2023-12-15 18:55:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:21,452 INFO L225 Difference]: With dead ends: 72508 [2023-12-15 18:55:21,453 INFO L226 Difference]: Without dead ends: 47675 [2023-12-15 18:55:21,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:21,476 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 824 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:21,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 898 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-15 18:55:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47675 states. [2023-12-15 18:55:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47675 to 46090. [2023-12-15 18:55:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46090 states, 46089 states have (on average 1.1848597279177244) internal successors, (54609), 46089 states have internal predecessors, (54609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46090 states to 46090 states and 54609 transitions. [2023-12-15 18:55:21,927 INFO L78 Accepts]: Start accepts. Automaton has 46090 states and 54609 transitions. Word has length 271 [2023-12-15 18:55:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:21,928 INFO L495 AbstractCegarLoop]: Abstraction has 46090 states and 54609 transitions. [2023-12-15 18:55:21,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46090 states and 54609 transitions. [2023-12-15 18:55:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2023-12-15 18:55:21,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:21,933 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:21,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 18:55:21,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:21,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1901814472, now seen corresponding path program 1 times [2023-12-15 18:55:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121784871] [2023-12-15 18:55:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 214 proven. 113 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-15 18:55:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:22,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121784871] [2023-12-15 18:55:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121784871] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:55:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245526543] [2023-12-15 18:55:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:22,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:55:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:55:23,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 18:55:23,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 18:55:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:23,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 18:55:23,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:55:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-12-15 18:55:23,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:55:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245526543] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:55:23,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-12-15 18:55:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437758182] [2023-12-15 18:55:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 18:55:23,253 INFO L87 Difference]: Start difference. First operand 46090 states and 54609 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:25,997 INFO L93 Difference]: Finished difference Result 91381 states and 108415 transitions. [2023-12-15 18:55:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2023-12-15 18:55:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:26,048 INFO L225 Difference]: With dead ends: 91381 [2023-12-15 18:55:26,048 INFO L226 Difference]: Without dead ends: 46079 [2023-12-15 18:55:26,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 18:55:26,073 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 1076 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:26,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 820 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-15 18:55:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46079 states. [2023-12-15 18:55:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46079 to 46076. [2023-12-15 18:55:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46076 states, 46075 states have (on average 1.1360607704829082) internal successors, (52344), 46075 states have internal predecessors, (52344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46076 states to 46076 states and 52344 transitions. [2023-12-15 18:55:26,505 INFO L78 Accepts]: Start accepts. Automaton has 46076 states and 52344 transitions. Word has length 350 [2023-12-15 18:55:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:26,505 INFO L495 AbstractCegarLoop]: Abstraction has 46076 states and 52344 transitions. [2023-12-15 18:55:26,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 46076 states and 52344 transitions. [2023-12-15 18:55:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2023-12-15 18:55:26,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:26,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:26,519 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-15 18:55:26,719 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,SelfDestructingSolverStorable9 [2023-12-15 18:55:26,719 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:26,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -604995767, now seen corresponding path program 1 times [2023-12-15 18:55:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231527651] [2023-12-15 18:55:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-15 18:55:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:27,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231527651] [2023-12-15 18:55:27,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231527651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:27,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:55:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84156768] [2023-12-15 18:55:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:27,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:27,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:27,038 INFO L87 Difference]: Start difference. First operand 46076 states and 52344 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:30,055 INFO L93 Difference]: Finished difference Result 101585 states and 116819 transitions. [2023-12-15 18:55:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:30,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2023-12-15 18:55:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:30,118 INFO L225 Difference]: With dead ends: 101585 [2023-12-15 18:55:30,118 INFO L226 Difference]: Without dead ends: 56297 [2023-12-15 18:55:30,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:30,144 INFO L413 NwaCegarLoop]: 1438 mSDtfsCounter, 1110 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:30,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1522 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-15 18:55:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56297 states. [2023-12-15 18:55:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56297 to 56296. [2023-12-15 18:55:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56296 states, 56295 states have (on average 1.1241673328004262) internal successors, (63285), 56295 states have internal predecessors, (63285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56296 states to 56296 states and 63285 transitions. [2023-12-15 18:55:30,704 INFO L78 Accepts]: Start accepts. Automaton has 56296 states and 63285 transitions. Word has length 359 [2023-12-15 18:55:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:30,704 INFO L495 AbstractCegarLoop]: Abstraction has 56296 states and 63285 transitions. [2023-12-15 18:55:30,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 56296 states and 63285 transitions. [2023-12-15 18:55:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2023-12-15 18:55:30,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:30,713 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-15 18:55:30,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 18:55:30,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:30,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1227654167, now seen corresponding path program 1 times [2023-12-15 18:55:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116420580] [2023-12-15 18:55:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-12-15 18:55:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116420580] [2023-12-15 18:55:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116420580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:55:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507734640] [2023-12-15 18:55:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:55:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:55:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 18:55:31,060 INFO L87 Difference]: Start difference. First operand 56296 states and 63285 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:37,081 INFO L93 Difference]: Finished difference Result 141881 states and 159542 transitions. [2023-12-15 18:55:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 18:55:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2023-12-15 18:55:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:37,168 INFO L225 Difference]: With dead ends: 141881 [2023-12-15 18:55:37,169 INFO L226 Difference]: Without dead ends: 86373 [2023-12-15 18:55:37,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-15 18:55:37,189 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 1677 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 6623 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 7552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 6623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:37,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 916 Invalid, 7552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 6623 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-15 18:55:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86373 states. [2023-12-15 18:55:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86373 to 68113. [2023-12-15 18:55:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68113 states, 68112 states have (on average 1.1126086445853887) internal successors, (75782), 68112 states have internal predecessors, (75782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68113 states to 68113 states and 75782 transitions. [2023-12-15 18:55:38,055 INFO L78 Accepts]: Start accepts. Automaton has 68113 states and 75782 transitions. Word has length 392 [2023-12-15 18:55:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:38,057 INFO L495 AbstractCegarLoop]: Abstraction has 68113 states and 75782 transitions. [2023-12-15 18:55:38,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 68113 states and 75782 transitions. [2023-12-15 18:55:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2023-12-15 18:55:38,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:38,082 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-15 18:55:38,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 18:55:38,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:38,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2106809376, now seen corresponding path program 1 times [2023-12-15 18:55:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260558486] [2023-12-15 18:55:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-15 18:55:38,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:38,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260558486] [2023-12-15 18:55:38,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260558486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:55:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561960495] [2023-12-15 18:55:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:38,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:38,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:38,514 INFO L87 Difference]: Start difference. First operand 68113 states and 75782 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:41,858 INFO L93 Difference]: Finished difference Result 159832 states and 178093 transitions. [2023-12-15 18:55:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2023-12-15 18:55:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:41,970 INFO L225 Difference]: With dead ends: 159832 [2023-12-15 18:55:41,970 INFO L226 Difference]: Without dead ends: 92507 [2023-12-15 18:55:42,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:42,014 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 830 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:42,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 781 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-15 18:55:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92507 states. [2023-12-15 18:55:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92507 to 90919. [2023-12-15 18:55:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90919 states, 90918 states have (on average 1.098715325898062) internal successors, (99893), 90918 states have internal predecessors, (99893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90919 states to 90919 states and 99893 transitions. [2023-12-15 18:55:43,017 INFO L78 Accepts]: Start accepts. Automaton has 90919 states and 99893 transitions. Word has length 405 [2023-12-15 18:55:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:43,017 INFO L495 AbstractCegarLoop]: Abstraction has 90919 states and 99893 transitions. [2023-12-15 18:55:43,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 90919 states and 99893 transitions. [2023-12-15 18:55:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2023-12-15 18:55:43,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:43,024 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-15 18:55:43,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 18:55:43,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:43,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1538354151, now seen corresponding path program 1 times [2023-12-15 18:55:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834404324] [2023-12-15 18:55:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:55:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2023-12-15 18:55:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:55:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834404324] [2023-12-15 18:55:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834404324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:55:43,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:55:43,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:55:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73538211] [2023-12-15 18:55:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:55:43,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:55:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:55:43,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:55:43,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:43,553 INFO L87 Difference]: Start difference. First operand 90919 states and 99893 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:55:46,517 INFO L93 Difference]: Finished difference Result 204686 states and 224263 transitions. [2023-12-15 18:55:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:55:46,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 425 [2023-12-15 18:55:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:55:46,660 INFO L225 Difference]: With dead ends: 204686 [2023-12-15 18:55:46,661 INFO L226 Difference]: Without dead ends: 114555 [2023-12-15 18:55:46,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:55:46,840 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 795 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-15 18:55:46,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1114 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-15 18:55:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114555 states. [2023-12-15 18:55:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114555 to 110598. [2023-12-15 18:55:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110598 states, 110597 states have (on average 1.0885105382605316) internal successors, (120386), 110597 states have internal predecessors, (120386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110598 states to 110598 states and 120386 transitions. [2023-12-15 18:55:48,102 INFO L78 Accepts]: Start accepts. Automaton has 110598 states and 120386 transitions. Word has length 425 [2023-12-15 18:55:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:55:48,102 INFO L495 AbstractCegarLoop]: Abstraction has 110598 states and 120386 transitions. [2023-12-15 18:55:48,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:55:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 110598 states and 120386 transitions. [2023-12-15 18:55:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2023-12-15 18:55:48,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:55:48,108 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-12-15 18:55:48,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 18:55:48,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:55:48,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:55:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1306435249, now seen corresponding path program 1 times [2023-12-15 18:55:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:55:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859075691] [2023-12-15 18:55:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:55:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:55:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-15 18:55:48,212 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 18:55:48,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 18:55:48,221 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-15 18:55:48,224 INFO L158 Benchmark]: Toolchain (without parser) took 60193.30ms. Allocated memory was 272.6MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 207.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-15 18:55:48,224 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 18:55:48,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1284.00ms. Allocated memory is still 272.6MB. Free memory was 207.6MB in the beginning and 125.6MB in the end (delta: 81.9MB). Peak memory consumption was 82.3MB. Max. memory is 8.0GB. [2023-12-15 18:55:48,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 457.18ms. Allocated memory was 272.6MB in the beginning and 383.8MB in the end (delta: 111.1MB). Free memory was 125.6MB in the beginning and 240.4MB in the end (delta: -114.8MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2023-12-15 18:55:48,225 INFO L158 Benchmark]: Boogie Preprocessor took 467.90ms. Allocated memory is still 383.8MB. Free memory was 240.4MB in the beginning and 193.8MB in the end (delta: 46.7MB). Peak memory consumption was 102.2MB. Max. memory is 8.0GB. [2023-12-15 18:55:48,225 INFO L158 Benchmark]: RCFGBuilder took 3811.88ms. Allocated memory was 383.8MB in the beginning and 767.6MB in the end (delta: 383.8MB). Free memory was 193.8MB in the beginning and 421.3MB in the end (delta: -227.5MB). Peak memory consumption was 291.0MB. Max. memory is 8.0GB. [2023-12-15 18:55:48,225 INFO L158 Benchmark]: TraceAbstraction took 54166.45ms. Allocated memory was 767.6MB in the beginning and 2.8GB in the end (delta: 2.0GB). Free memory was 420.3MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 896.0MB. Max. memory is 8.0GB. [2023-12-15 18:55:48,226 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1284.00ms. Allocated memory is still 272.6MB. Free memory was 207.6MB in the beginning and 125.6MB in the end (delta: 81.9MB). Peak memory consumption was 82.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 457.18ms. Allocated memory was 272.6MB in the beginning and 383.8MB in the end (delta: 111.1MB). Free memory was 125.6MB in the beginning and 240.4MB in the end (delta: -114.8MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 467.90ms. Allocated memory is still 383.8MB. Free memory was 240.4MB in the beginning and 193.8MB in the end (delta: 46.7MB). Peak memory consumption was 102.2MB. Max. memory is 8.0GB. * RCFGBuilder took 3811.88ms. Allocated memory was 383.8MB in the beginning and 767.6MB in the end (delta: 383.8MB). Free memory was 193.8MB in the beginning and 421.3MB in the end (delta: -227.5MB). Peak memory consumption was 291.0MB. Max. memory is 8.0GB. * TraceAbstraction took 54166.45ms. Allocated memory was 767.6MB in the beginning and 2.8GB in the end (delta: 2.0GB). Free memory was 420.3MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 896.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown