/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/bitvector/byte_add_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 21:51:44,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 21:51:44,273 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-18 21:51:44,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 21:51:44,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 21:51:44,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 21:51:44,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 21:51:44,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 21:51:44,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 21:51:44,302 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 21:51:44,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 21:51:44,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 21:51:44,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 21:51:44,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 21:51:44,303 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 21:51:44,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 21:51:44,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 21:51:44,304 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 21:51:44,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 21:51:44,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 21:51:44,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 21:51:44,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 21:51:44,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 21:51:44,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 21:51:44,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 21:51:44,308 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 21:51:44,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 21:51:44,308 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 21:51:44,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 21:51:44,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 21:51:44,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 21:51:44,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 21:51:44,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 21:51:44,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 21:51:44,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 21:51:44,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 21:51:44,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 21:51:44,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 21:51:44,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 21:51:44,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 21:51:44,311 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 21:51:44,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 21:51:44,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 21:51:44,314 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-18 21:51:44,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 21:51:44,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 21:51:44,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 21:51:44,526 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 21:51:44,527 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 21:51:44,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-12-18 21:51:45,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 21:51:45,766 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 21:51:45,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-12-18 21:51:45,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1073d0ce/be56ce50d0054ed5bebb7751416e482d/FLAG1c7a2b4db [2023-12-18 21:51:45,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1073d0ce/be56ce50d0054ed5bebb7751416e482d [2023-12-18 21:51:45,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 21:51:45,790 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 21:51:45,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 21:51:45,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 21:51:45,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 21:51:45,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:45,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45, skipping insertion in model container [2023-12-18 21:51:45,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:45,823 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 21:51:45,918 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-12-18 21:51:45,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 21:51:45,957 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 21:51:45,965 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-12-18 21:51:45,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 21:51:45,995 INFO L206 MainTranslator]: Completed translation [2023-12-18 21:51:45,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45 WrapperNode [2023-12-18 21:51:45,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 21:51:45,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 21:51:45,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 21:51:45,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 21:51:46,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,037 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2023-12-18 21:51:46,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 21:51:46,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 21:51:46,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 21:51:46,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 21:51:46,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,063 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-18 21:51:46,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 21:51:46,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 21:51:46,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 21:51:46,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 21:51:46,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (1/1) ... [2023-12-18 21:51:46,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 21:51:46,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:46,099 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-18 21:51:46,114 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-18 21:51:46,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 21:51:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 21:51:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 21:51:46,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 21:51:46,186 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 21:51:46,188 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 21:51:46,475 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 21:51:46,498 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 21:51:46,498 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-18 21:51:46,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:51:46 BoogieIcfgContainer [2023-12-18 21:51:46,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 21:51:46,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 21:51:46,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 21:51:46,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 21:51:46,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:51:45" (1/3) ... [2023-12-18 21:51:46,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292459fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:51:46, skipping insertion in model container [2023-12-18 21:51:46,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:51:45" (2/3) ... [2023-12-18 21:51:46,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292459fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:51:46, skipping insertion in model container [2023-12-18 21:51:46,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:51:46" (3/3) ... [2023-12-18 21:51:46,507 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2023-12-18 21:51:46,536 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 21:51:46,537 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-18 21:51:46,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 21:51:46,577 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;@1c7304e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 21:51:46,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-18 21:51:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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-18 21:51:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-18 21:51:46,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:46,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:46,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:46,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash -701051337, now seen corresponding path program 1 times [2023-12-18 21:51:46,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:46,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898944956] [2023-12-18 21:51:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:46,770 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-18 21:51:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898944956] [2023-12-18 21:51:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898944956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 21:51:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826303856] [2023-12-18 21:51:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:46,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-18 21:51:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-18 21:51:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 21:51:46,806 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-18 21:51:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:46,845 INFO L93 Difference]: Finished difference Result 62 states and 109 transitions. [2023-12-18 21:51:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-18 21:51:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2023-12-18 21:51:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:46,852 INFO L225 Difference]: With dead ends: 62 [2023-12-18 21:51:46,852 INFO L226 Difference]: Without dead ends: 42 [2023-12-18 21:51:46,855 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-18 21:51:46,857 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:46,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 21:51:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-18 21:51:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-18 21:51:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 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-18 21:51:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2023-12-18 21:51:46,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 13 [2023-12-18 21:51:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:46,888 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2023-12-18 21:51:46,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-18 21:51:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2023-12-18 21:51:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-18 21:51:46,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:46,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:46,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 21:51:46,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:46,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1267888409, now seen corresponding path program 1 times [2023-12-18 21:51:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:46,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402718083] [2023-12-18 21:51:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:47,040 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-18 21:51:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402718083] [2023-12-18 21:51:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402718083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:47,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:47,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 21:51:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855809383] [2023-12-18 21:51:47,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:47,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 21:51:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 21:51:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 21:51:47,043 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-18 21:51:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:47,148 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2023-12-18 21:51:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 21:51:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2023-12-18 21:51:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:47,151 INFO L225 Difference]: With dead ends: 98 [2023-12-18 21:51:47,151 INFO L226 Difference]: Without dead ends: 65 [2023-12-18 21:51:47,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 21:51:47,154 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:47,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-18 21:51:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-12-18 21:51:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 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-18 21:51:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2023-12-18 21:51:47,170 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 13 [2023-12-18 21:51:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:47,170 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2023-12-18 21:51:47,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-18 21:51:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2023-12-18 21:51:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-18 21:51:47,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:47,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:47,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 21:51:47,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:47,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1612037902, now seen corresponding path program 1 times [2023-12-18 21:51:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786024981] [2023-12-18 21:51:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 21:51:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786024981] [2023-12-18 21:51:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786024981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 21:51:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107241615] [2023-12-18 21:51:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:47,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:51:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:51:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 21:51:47,360 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-18 21:51:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:47,546 INFO L93 Difference]: Finished difference Result 155 states and 270 transitions. [2023-12-18 21:51:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 21:51:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-12-18 21:51:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:47,550 INFO L225 Difference]: With dead ends: 155 [2023-12-18 21:51:47,550 INFO L226 Difference]: Without dead ends: 122 [2023-12-18 21:51:47,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-18 21:51:47,553 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:47,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 99 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-18 21:51:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2023-12-18 21:51:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.576470588235294) internal successors, (134), 85 states have internal predecessors, (134), 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-18 21:51:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2023-12-18 21:51:47,573 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 19 [2023-12-18 21:51:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:47,573 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2023-12-18 21:51:47,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-18 21:51:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2023-12-18 21:51:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-18 21:51:47,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:47,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:47,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-18 21:51:47,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:47,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1944328577, now seen corresponding path program 1 times [2023-12-18 21:51:47,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884816764] [2023-12-18 21:51:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:47,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-18 21:51:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:47,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884816764] [2023-12-18 21:51:47,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884816764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:47,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:47,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 21:51:47,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927992975] [2023-12-18 21:51:47,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:47,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:51:47,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:51:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 21:51:47,688 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-18 21:51:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:47,813 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2023-12-18 21:51:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 21:51:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 25 [2023-12-18 21:51:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:47,815 INFO L225 Difference]: With dead ends: 247 [2023-12-18 21:51:47,815 INFO L226 Difference]: Without dead ends: 173 [2023-12-18 21:51:47,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-18 21:51:47,823 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:47,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 198 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-18 21:51:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 94. [2023-12-18 21:51:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 93 states have internal predecessors, (143), 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-18 21:51:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2023-12-18 21:51:47,836 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 25 [2023-12-18 21:51:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:47,836 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2023-12-18 21:51:47,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-18 21:51:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2023-12-18 21:51:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-18 21:51:47,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:47,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-18 21:51:47,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:47,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash 889628198, now seen corresponding path program 1 times [2023-12-18 21:51:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889359677] [2023-12-18 21:51:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-18 21:51:47,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:47,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889359677] [2023-12-18 21:51:47,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889359677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:47,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 21:51:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775566112] [2023-12-18 21:51:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:47,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:51:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:51:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 21:51:47,935 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-18 21:51:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:48,038 INFO L93 Difference]: Finished difference Result 268 states and 406 transitions. [2023-12-18 21:51:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 21:51:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2023-12-18 21:51:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:48,039 INFO L225 Difference]: With dead ends: 268 [2023-12-18 21:51:48,039 INFO L226 Difference]: Without dead ends: 193 [2023-12-18 21:51:48,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-18 21:51:48,040 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:48,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 206 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-18 21:51:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2023-12-18 21:51:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 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-18 21:51:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2023-12-18 21:51:48,046 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 26 [2023-12-18 21:51:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:48,047 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2023-12-18 21:51:48,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-18 21:51:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2023-12-18 21:51:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-18 21:51:48,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:48,048 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:51:48,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-18 21:51:48,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:48,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash -449843762, now seen corresponding path program 1 times [2023-12-18 21:51:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:48,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023076391] [2023-12-18 21:51:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 21:51:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023076391] [2023-12-18 21:51:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023076391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835477617] [2023-12-18 21:51:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:48,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:48,119 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-18 21:51:48,140 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-18 21:51:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:48,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-18 21:51:48,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-18 21:51:48,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 21:51:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835477617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 21:51:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-18 21:51:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108324918] [2023-12-18 21:51:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:48,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:51:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:48,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:51:48,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-18 21:51:48,237 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-18 21:51:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:48,384 INFO L93 Difference]: Finished difference Result 221 states and 354 transitions. [2023-12-18 21:51:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 21:51:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 27 [2023-12-18 21:51:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:48,388 INFO L225 Difference]: With dead ends: 221 [2023-12-18 21:51:48,388 INFO L226 Difference]: Without dead ends: 149 [2023-12-18 21:51:48,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-18 21:51:48,389 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:48,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-18 21:51:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2023-12-18 21:51:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 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-18 21:51:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2023-12-18 21:51:48,394 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 27 [2023-12-18 21:51:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:48,394 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2023-12-18 21:51:48,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-18 21:51:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2023-12-18 21:51:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-18 21:51:48,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:48,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:48,403 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-18 21:51:48,603 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,SelfDestructingSolverStorable5 [2023-12-18 21:51:48,604 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:48,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1572960125, now seen corresponding path program 1 times [2023-12-18 21:51:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618182777] [2023-12-18 21:51:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 21:51:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618182777] [2023-12-18 21:51:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618182777] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791958102] [2023-12-18 21:51:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:48,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:48,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:48,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:48,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-18 21:51:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:48,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-18 21:51:48,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-18 21:51:48,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 21:51:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791958102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 21:51:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-18 21:51:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913996873] [2023-12-18 21:51:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:48,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 21:51:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:48,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 21:51:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-18 21:51:48,810 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-18 21:51:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:49,005 INFO L93 Difference]: Finished difference Result 525 states and 771 transitions. [2023-12-18 21:51:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-18 21:51:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 33 [2023-12-18 21:51:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:49,008 INFO L225 Difference]: With dead ends: 525 [2023-12-18 21:51:49,008 INFO L226 Difference]: Without dead ends: 396 [2023-12-18 21:51:49,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-18 21:51:49,010 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 176 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:49,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 356 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 21:51:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-18 21:51:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 303. [2023-12-18 21:51:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4105960264900663) internal successors, (426), 302 states have internal predecessors, (426), 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-18 21:51:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2023-12-18 21:51:49,021 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 33 [2023-12-18 21:51:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:49,021 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2023-12-18 21:51:49,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-18 21:51:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2023-12-18 21:51:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-18 21:51:49,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:49,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:49,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-18 21:51:49,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-18 21:51:49,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:49,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1205786005, now seen corresponding path program 1 times [2023-12-18 21:51:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914648125] [2023-12-18 21:51:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 21:51:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914648125] [2023-12-18 21:51:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914648125] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722582734] [2023-12-18 21:51:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:49,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:49,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-18 21:51:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:49,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-18 21:51:49,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-18 21:51:49,384 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 21:51:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722582734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:49,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 21:51:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-18 21:51:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22702108] [2023-12-18 21:51:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:49,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:51:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:51:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-18 21:51:49,385 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-18 21:51:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:49,513 INFO L93 Difference]: Finished difference Result 709 states and 1033 transitions. [2023-12-18 21:51:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 21:51:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 34 [2023-12-18 21:51:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:49,515 INFO L225 Difference]: With dead ends: 709 [2023-12-18 21:51:49,515 INFO L226 Difference]: Without dead ends: 433 [2023-12-18 21:51:49,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-18 21:51:49,516 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:49,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-18 21:51:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 361. [2023-12-18 21:51:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3777777777777778) internal successors, (496), 360 states have internal predecessors, (496), 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-18 21:51:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2023-12-18 21:51:49,524 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 34 [2023-12-18 21:51:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:49,525 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2023-12-18 21:51:49,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-18 21:51:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2023-12-18 21:51:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-18 21:51:49,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:49,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:49,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-18 21:51:49,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:49,733 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:49,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1759920966, now seen corresponding path program 1 times [2023-12-18 21:51:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181776828] [2023-12-18 21:51:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-18 21:51:49,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181776828] [2023-12-18 21:51:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181776828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 21:51:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787122938] [2023-12-18 21:51:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:49,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 21:51:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 21:51:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 21:51:49,868 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-18 21:51:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:50,062 INFO L93 Difference]: Finished difference Result 1438 states and 1956 transitions. [2023-12-18 21:51:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 21:51:50,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 40 [2023-12-18 21:51:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:50,066 INFO L225 Difference]: With dead ends: 1438 [2023-12-18 21:51:50,066 INFO L226 Difference]: Without dead ends: 1110 [2023-12-18 21:51:50,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-18 21:51:50,068 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 199 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:50,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 401 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 21:51:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-12-18 21:51:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 361. [2023-12-18 21:51:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3777777777777778) internal successors, (496), 360 states have internal predecessors, (496), 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-18 21:51:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2023-12-18 21:51:50,082 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 40 [2023-12-18 21:51:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:50,083 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2023-12-18 21:51:50,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-18 21:51:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2023-12-18 21:51:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-18 21:51:50,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:50,085 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:50,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-18 21:51:50,085 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:50,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1087520423, now seen corresponding path program 1 times [2023-12-18 21:51:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405870632] [2023-12-18 21:51:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-18 21:51:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405870632] [2023-12-18 21:51:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405870632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:50,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:50,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 21:51:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457259952] [2023-12-18 21:51:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:50,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 21:51:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 21:51:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 21:51:50,224 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-18 21:51:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:50,515 INFO L93 Difference]: Finished difference Result 749 states and 1024 transitions. [2023-12-18 21:51:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-18 21:51:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 41 [2023-12-18 21:51:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:50,518 INFO L225 Difference]: With dead ends: 749 [2023-12-18 21:51:50,518 INFO L226 Difference]: Without dead ends: 614 [2023-12-18 21:51:50,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-18 21:51:50,518 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 284 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:50,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 621 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 21:51:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2023-12-18 21:51:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 372. [2023-12-18 21:51:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.3692722371967656) internal successors, (508), 371 states have internal predecessors, (508), 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-18 21:51:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 508 transitions. [2023-12-18 21:51:50,535 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 508 transitions. Word has length 41 [2023-12-18 21:51:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:50,535 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 508 transitions. [2023-12-18 21:51:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-18 21:51:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 508 transitions. [2023-12-18 21:51:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-18 21:51:50,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:50,536 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:50,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-18 21:51:50,537 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:50,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1156462875, now seen corresponding path program 1 times [2023-12-18 21:51:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:50,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681869450] [2023-12-18 21:51:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-18 21:51:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681869450] [2023-12-18 21:51:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681869450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:50,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:50,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 21:51:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50621330] [2023-12-18 21:51:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:50,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 21:51:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 21:51:50,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 21:51:50,637 INFO L87 Difference]: Start difference. First operand 372 states and 508 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-18 21:51:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:50,653 INFO L93 Difference]: Finished difference Result 722 states and 983 transitions. [2023-12-18 21:51:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 21:51:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 41 [2023-12-18 21:51:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:50,655 INFO L225 Difference]: With dead ends: 722 [2023-12-18 21:51:50,655 INFO L226 Difference]: Without dead ends: 352 [2023-12-18 21:51:50,655 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-18 21:51:50,656 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:50,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 21:51:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-18 21:51:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2023-12-18 21:51:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.358974358974359) internal successors, (477), 351 states have internal predecessors, (477), 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-18 21:51:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 477 transitions. [2023-12-18 21:51:50,670 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 477 transitions. Word has length 41 [2023-12-18 21:51:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:50,670 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 477 transitions. [2023-12-18 21:51:50,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-18 21:51:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 477 transitions. [2023-12-18 21:51:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-18 21:51:50,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:50,671 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-18 21:51:50,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-18 21:51:50,671 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:50,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash -49999210, now seen corresponding path program 1 times [2023-12-18 21:51:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719606309] [2023-12-18 21:51:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-18 21:51:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719606309] [2023-12-18 21:51:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719606309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 21:51:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7034932] [2023-12-18 21:51:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 21:51:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 21:51:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 21:51:50,724 INFO L87 Difference]: Start difference. First operand 352 states and 477 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-18 21:51:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:50,744 INFO L93 Difference]: Finished difference Result 492 states and 654 transitions. [2023-12-18 21:51:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 21:51:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 46 [2023-12-18 21:51:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:50,746 INFO L225 Difference]: With dead ends: 492 [2023-12-18 21:51:50,746 INFO L226 Difference]: Without dead ends: 449 [2023-12-18 21:51:50,746 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-18 21:51:50,746 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:50,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 21:51:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-18 21:51:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 437. [2023-12-18 21:51:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3211009174311927) internal successors, (576), 436 states have internal predecessors, (576), 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-18 21:51:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 576 transitions. [2023-12-18 21:51:50,779 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 576 transitions. Word has length 46 [2023-12-18 21:51:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:50,780 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 576 transitions. [2023-12-18 21:51:50,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-18 21:51:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 576 transitions. [2023-12-18 21:51:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-18 21:51:50,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:50,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-18 21:51:50,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-18 21:51:50,781 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:50,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 224760404, now seen corresponding path program 1 times [2023-12-18 21:51:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719009683] [2023-12-18 21:51:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-18 21:51:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719009683] [2023-12-18 21:51:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719009683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468206] [2023-12-18 21:51:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:50,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:50,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:50,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-18 21:51:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:50,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-18 21:51:50,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-18 21:51:50,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 21:51:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:50,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 21:51:50,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-18 21:51:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829926043] [2023-12-18 21:51:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:50,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:51:50,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:50,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:51:50,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-18 21:51:50,973 INFO L87 Difference]: Start difference. First operand 437 states and 576 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-18 21:51:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:51,059 INFO L93 Difference]: Finished difference Result 976 states and 1299 transitions. [2023-12-18 21:51:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 21:51:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 46 [2023-12-18 21:51:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:51,061 INFO L225 Difference]: With dead ends: 976 [2023-12-18 21:51:51,061 INFO L226 Difference]: Without dead ends: 479 [2023-12-18 21:51:51,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-18 21:51:51,062 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:51,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 66 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-12-18 21:51:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 389. [2023-12-18 21:51:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.2860824742268042) internal successors, (499), 388 states have internal predecessors, (499), 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-18 21:51:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2023-12-18 21:51:51,076 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 46 [2023-12-18 21:51:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:51,076 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2023-12-18 21:51:51,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-18 21:51:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2023-12-18 21:51:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-18 21:51:51,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:51,077 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:51,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-18 21:51:51,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:51,296 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:51,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash 315293426, now seen corresponding path program 1 times [2023-12-18 21:51:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331576298] [2023-12-18 21:51:51,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-18 21:51:51,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:51,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331576298] [2023-12-18 21:51:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331576298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 21:51:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475472962] [2023-12-18 21:51:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:51,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 21:51:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 21:51:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-18 21:51:51,435 INFO L87 Difference]: Start difference. First operand 389 states and 499 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-18 21:51:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:51,517 INFO L93 Difference]: Finished difference Result 1193 states and 1522 transitions. [2023-12-18 21:51:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 21:51:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 67 [2023-12-18 21:51:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:51,519 INFO L225 Difference]: With dead ends: 1193 [2023-12-18 21:51:51,520 INFO L226 Difference]: Without dead ends: 830 [2023-12-18 21:51:51,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-18 21:51:51,521 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 160 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:51,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 155 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 21:51:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-12-18 21:51:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 587. [2023-12-18 21:51:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.2781569965870307) internal successors, (749), 586 states have internal predecessors, (749), 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-18 21:51:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 749 transitions. [2023-12-18 21:51:51,544 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 749 transitions. Word has length 67 [2023-12-18 21:51:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:51,544 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 749 transitions. [2023-12-18 21:51:51,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-18 21:51:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 749 transitions. [2023-12-18 21:51:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-18 21:51:51,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:51,545 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:51,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-18 21:51:51,545 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:51,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1310614836, now seen corresponding path program 1 times [2023-12-18 21:51:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994426416] [2023-12-18 21:51:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-18 21:51:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994426416] [2023-12-18 21:51:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994426416] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444545167] [2023-12-18 21:51:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:51,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:51,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-18 21:51:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:51,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-18 21:51:51,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 31 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-18 21:51:52,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:51:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-18 21:51:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444545167] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:51:52,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:51:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-12-18 21:51:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581937495] [2023-12-18 21:51:52,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:51:52,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-18 21:51:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:52,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-18 21:51:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-12-18 21:51:52,250 INFO L87 Difference]: Start difference. First operand 587 states and 749 transitions. Second operand has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 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-18 21:51:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:54,727 INFO L93 Difference]: Finished difference Result 2268 states and 2894 transitions. [2023-12-18 21:51:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-18 21:51:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 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 67 [2023-12-18 21:51:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:54,734 INFO L225 Difference]: With dead ends: 2268 [2023-12-18 21:51:54,734 INFO L226 Difference]: Without dead ends: 2260 [2023-12-18 21:51:54,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1883, Invalid=7047, Unknown=0, NotChecked=0, Total=8930 [2023-12-18 21:51:54,738 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 818 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:54,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1929 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-18 21:51:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2023-12-18 21:51:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 981. [2023-12-18 21:51:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.3081632653061224) internal successors, (1282), 980 states have internal predecessors, (1282), 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-18 21:51:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1282 transitions. [2023-12-18 21:51:54,801 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1282 transitions. Word has length 67 [2023-12-18 21:51:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:54,801 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1282 transitions. [2023-12-18 21:51:54,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 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-18 21:51:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1282 transitions. [2023-12-18 21:51:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-18 21:51:54,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:54,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:54,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-18 21:51:55,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-18 21:51:55,008 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:55,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1049730223, now seen corresponding path program 1 times [2023-12-18 21:51:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:55,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973473801] [2023-12-18 21:51:55,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-18 21:51:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973473801] [2023-12-18 21:51:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973473801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:51:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 21:51:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 21:51:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870218371] [2023-12-18 21:51:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:51:55,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 21:51:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 21:51:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 21:51:55,168 INFO L87 Difference]: Start difference. First operand 981 states and 1282 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-18 21:51:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:55,538 INFO L93 Difference]: Finished difference Result 2278 states and 3001 transitions. [2023-12-18 21:51:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 21:51:55,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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 69 [2023-12-18 21:51:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:55,543 INFO L225 Difference]: With dead ends: 2278 [2023-12-18 21:51:55,543 INFO L226 Difference]: Without dead ends: 1673 [2023-12-18 21:51:55,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-18 21:51:55,545 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 307 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:55,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 554 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 21:51:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2023-12-18 21:51:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 977. [2023-12-18 21:51:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3094262295081966) internal successors, (1278), 976 states have internal predecessors, (1278), 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-18 21:51:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1278 transitions. [2023-12-18 21:51:55,588 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1278 transitions. Word has length 69 [2023-12-18 21:51:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:55,588 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1278 transitions. [2023-12-18 21:51:55,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-18 21:51:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1278 transitions. [2023-12-18 21:51:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-18 21:51:55,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:55,589 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-18 21:51:55,589 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:55,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -667674692, now seen corresponding path program 1 times [2023-12-18 21:51:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055779464] [2023-12-18 21:51:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-18 21:51:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:55,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055779464] [2023-12-18 21:51:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055779464] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028359201] [2023-12-18 21:51:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:55,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:55,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:55,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:55,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-18 21:51:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:55,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-18 21:51:55,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-18 21:51:55,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:51:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-18 21:51:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028359201] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:51:56,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:51:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2023-12-18 21:51:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566819768] [2023-12-18 21:51:56,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:51:56,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-18 21:51:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-18 21:51:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-12-18 21:51:56,111 INFO L87 Difference]: Start difference. First operand 977 states and 1278 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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-18 21:51:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:56,823 INFO L93 Difference]: Finished difference Result 3069 states and 4034 transitions. [2023-12-18 21:51:56,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-18 21:51:56,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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 71 [2023-12-18 21:51:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:56,828 INFO L225 Difference]: With dead ends: 3069 [2023-12-18 21:51:56,828 INFO L226 Difference]: Without dead ends: 2061 [2023-12-18 21:51:56,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2023-12-18 21:51:56,831 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 716 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:56,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 556 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-18 21:51:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2023-12-18 21:51:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1687. [2023-12-18 21:51:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 1.2965599051008303) internal successors, (2186), 1686 states have internal predecessors, (2186), 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-18 21:51:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2186 transitions. [2023-12-18 21:51:56,901 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2186 transitions. Word has length 71 [2023-12-18 21:51:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:56,902 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2186 transitions. [2023-12-18 21:51:56,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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-18 21:51:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2186 transitions. [2023-12-18 21:51:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-18 21:51:56,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:56,906 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:51:56,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-18 21:51:57,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-18 21:51:57,111 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:57,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 64292734, now seen corresponding path program 1 times [2023-12-18 21:51:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41208770] [2023-12-18 21:51:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-18 21:51:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41208770] [2023-12-18 21:51:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41208770] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771919707] [2023-12-18 21:51:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:57,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:57,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:57,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:57,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-18 21:51:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:57,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-18 21:51:57,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-18 21:51:57,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:51:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-18 21:51:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771919707] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:51:57,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:51:57,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-18 21:51:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022196358] [2023-12-18 21:51:57,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:51:57,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-18 21:51:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:51:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-18 21:51:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-18 21:51:57,757 INFO L87 Difference]: Start difference. First operand 1687 states and 2186 transitions. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 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-18 21:51:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:51:58,040 INFO L93 Difference]: Finished difference Result 3460 states and 4436 transitions. [2023-12-18 21:51:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 21:51:58,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 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 71 [2023-12-18 21:51:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:51:58,046 INFO L225 Difference]: With dead ends: 3460 [2023-12-18 21:51:58,046 INFO L226 Difference]: Without dead ends: 1845 [2023-12-18 21:51:58,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-12-18 21:51:58,048 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 232 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 21:51:58,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 554 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 21:51:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2023-12-18 21:51:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1377. [2023-12-18 21:51:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.273982558139535) internal successors, (1753), 1376 states have internal predecessors, (1753), 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-18 21:51:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1753 transitions. [2023-12-18 21:51:58,132 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1753 transitions. Word has length 71 [2023-12-18 21:51:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:51:58,132 INFO L495 AbstractCegarLoop]: Abstraction has 1377 states and 1753 transitions. [2023-12-18 21:51:58,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 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-18 21:51:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1753 transitions. [2023-12-18 21:51:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-18 21:51:58,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:51:58,134 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-18 21:51:58,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-18 21:51:58,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:58,339 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:51:58,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:51:58,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1987520768, now seen corresponding path program 2 times [2023-12-18 21:51:58,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:51:58,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631405349] [2023-12-18 21:51:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:51:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:51:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:51:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-18 21:51:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:51:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631405349] [2023-12-18 21:51:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631405349] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:51:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686677279] [2023-12-18 21:51:58,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 21:51:58,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:51:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:51:58,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:51:58,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-18 21:51:58,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 21:51:58,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 21:51:58,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-18 21:51:58,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:51:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-18 21:51:59,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:52:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-18 21:52:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686677279] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:52:00,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:52:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 27 [2023-12-18 21:52:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624190743] [2023-12-18 21:52:00,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:52:00,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-18 21:52:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:52:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-18 21:52:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2023-12-18 21:52:00,013 INFO L87 Difference]: Start difference. First operand 1377 states and 1753 transitions. Second operand has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 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-18 21:52:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:52:09,867 INFO L93 Difference]: Finished difference Result 9708 states and 11992 transitions. [2023-12-18 21:52:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2023-12-18 21:52:09,867 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 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 71 [2023-12-18 21:52:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:52:09,888 INFO L225 Difference]: With dead ends: 9708 [2023-12-18 21:52:09,888 INFO L226 Difference]: Without dead ends: 9702 [2023-12-18 21:52:09,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6828 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3353, Invalid=17239, Unknown=0, NotChecked=0, Total=20592 [2023-12-18 21:52:09,893 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 1946 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-18 21:52:09,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 2464 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-18 21:52:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2023-12-18 21:52:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 2897. [2023-12-18 21:52:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 1.298342541436464) internal successors, (3760), 2896 states have internal predecessors, (3760), 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-18 21:52:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 3760 transitions. [2023-12-18 21:52:10,094 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 3760 transitions. Word has length 71 [2023-12-18 21:52:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:52:10,094 INFO L495 AbstractCegarLoop]: Abstraction has 2897 states and 3760 transitions. [2023-12-18 21:52:10,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 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-18 21:52:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3760 transitions. [2023-12-18 21:52:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-18 21:52:10,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:52:10,096 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-18 21:52:10,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-18 21:52:10,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:52:10,301 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:52:10,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:52:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1484894367, now seen corresponding path program 1 times [2023-12-18 21:52:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:52:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166376225] [2023-12-18 21:52:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:52:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-18 21:52:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:52:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166376225] [2023-12-18 21:52:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166376225] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:52:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970489183] [2023-12-18 21:52:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:52:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:52:10,759 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:52:10,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-18 21:52:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:11,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-18 21:52:11,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:52:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-18 21:52:11,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:52:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-18 21:52:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970489183] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:52:11,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:52:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 21 [2023-12-18 21:52:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523690882] [2023-12-18 21:52:11,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:52:11,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-18 21:52:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:52:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-18 21:52:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-18 21:52:11,514 INFO L87 Difference]: Start difference. First operand 2897 states and 3760 transitions. Second operand has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 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-18 21:52:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:52:12,587 INFO L93 Difference]: Finished difference Result 7031 states and 9070 transitions. [2023-12-18 21:52:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-18 21:52:12,587 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 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 72 [2023-12-18 21:52:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:52:12,600 INFO L225 Difference]: With dead ends: 7031 [2023-12-18 21:52:12,600 INFO L226 Difference]: Without dead ends: 4502 [2023-12-18 21:52:12,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2023-12-18 21:52:12,602 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 478 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-18 21:52:12,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1282 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-18 21:52:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2023-12-18 21:52:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 3049. [2023-12-18 21:52:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 3048 states have (on average 1.3162729658792651) internal successors, (4012), 3048 states have internal predecessors, (4012), 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-18 21:52:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4012 transitions. [2023-12-18 21:52:12,768 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4012 transitions. Word has length 72 [2023-12-18 21:52:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:52:12,768 INFO L495 AbstractCegarLoop]: Abstraction has 3049 states and 4012 transitions. [2023-12-18 21:52:12,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 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-18 21:52:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4012 transitions. [2023-12-18 21:52:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-18 21:52:12,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:52:12,770 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:52:12,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-18 21:52:12,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:52:12,978 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:52:12,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:52:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1960049728, now seen corresponding path program 1 times [2023-12-18 21:52:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:52:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095422158] [2023-12-18 21:52:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:52:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-18 21:52:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:52:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095422158] [2023-12-18 21:52:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095422158] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:52:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670801270] [2023-12-18 21:52:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:52:13,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:52:13,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:52:13,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-18 21:52:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:13,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-18 21:52:13,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:52:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-18 21:52:13,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 21:52:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670801270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 21:52:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 21:52:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2023-12-18 21:52:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152476174] [2023-12-18 21:52:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 21:52:13,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 21:52:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:52:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 21:52:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-18 21:52:13,783 INFO L87 Difference]: Start difference. First operand 3049 states and 4012 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-18 21:52:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:52:14,018 INFO L93 Difference]: Finished difference Result 3068 states and 4036 transitions. [2023-12-18 21:52:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 21:52:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 72 [2023-12-18 21:52:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:52:14,029 INFO L225 Difference]: With dead ends: 3068 [2023-12-18 21:52:14,029 INFO L226 Difference]: Without dead ends: 3064 [2023-12-18 21:52:14,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-18 21:52:14,030 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 21:52:14,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 21:52:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2023-12-18 21:52:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3055. [2023-12-18 21:52:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 3054 states have (on average 1.3159790438768828) internal successors, (4019), 3054 states have internal predecessors, (4019), 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-18 21:52:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 4019 transitions. [2023-12-18 21:52:14,181 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 4019 transitions. Word has length 72 [2023-12-18 21:52:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:52:14,182 INFO L495 AbstractCegarLoop]: Abstraction has 3055 states and 4019 transitions. [2023-12-18 21:52:14,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-18 21:52:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 4019 transitions. [2023-12-18 21:52:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-18 21:52:14,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:52:14,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:52:14,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-18 21:52:14,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-18 21:52:14,388 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:52:14,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:52:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1510466783, now seen corresponding path program 1 times [2023-12-18 21:52:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:52:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615043594] [2023-12-18 21:52:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:52:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-18 21:52:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:52:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615043594] [2023-12-18 21:52:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615043594] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:52:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798378170] [2023-12-18 21:52:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:14,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:52:14,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:52:14,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:52:14,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-18 21:52:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:14,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-18 21:52:14,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:52:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-18 21:52:14,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:52:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-18 21:52:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798378170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:52:14,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:52:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2023-12-18 21:52:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147375155] [2023-12-18 21:52:14,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:52:14,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-18 21:52:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:52:14,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-18 21:52:14,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-18 21:52:14,928 INFO L87 Difference]: Start difference. First operand 3055 states and 4019 transitions. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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-18 21:52:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:52:15,856 INFO L93 Difference]: Finished difference Result 7364 states and 9469 transitions. [2023-12-18 21:52:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 21:52:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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 72 [2023-12-18 21:52:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:52:15,864 INFO L225 Difference]: With dead ends: 7364 [2023-12-18 21:52:15,864 INFO L226 Difference]: Without dead ends: 7360 [2023-12-18 21:52:15,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2023-12-18 21:52:15,865 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 627 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 21:52:15,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 531 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 21:52:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2023-12-18 21:52:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 4097. [2023-12-18 21:52:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.3671875) internal successors, (5600), 4096 states have internal predecessors, (5600), 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-18 21:52:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5600 transitions. [2023-12-18 21:52:16,102 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5600 transitions. Word has length 72 [2023-12-18 21:52:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:52:16,102 INFO L495 AbstractCegarLoop]: Abstraction has 4097 states and 5600 transitions. [2023-12-18 21:52:16,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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-18 21:52:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5600 transitions. [2023-12-18 21:52:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-18 21:52:16,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:52:16,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:52:16,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-18 21:52:16,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-18 21:52:16,312 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:52:16,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:52:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1510407201, now seen corresponding path program 1 times [2023-12-18 21:52:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:52:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649388650] [2023-12-18 21:52:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:52:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-18 21:52:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 21:52:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649388650] [2023-12-18 21:52:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649388650] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 21:52:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094365290] [2023-12-18 21:52:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:16,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 21:52:16,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 21:52:16,532 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 21:52:16,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-18 21:52:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 21:52:16,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-18 21:52:16,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 21:52:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-18 21:52:16,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 21:52:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-18 21:52:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094365290] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 21:52:17,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 21:52:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-12-18 21:52:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653009721] [2023-12-18 21:52:17,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 21:52:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-18 21:52:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 21:52:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-18 21:52:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2023-12-18 21:52:17,049 INFO L87 Difference]: Start difference. First operand 4097 states and 5600 transitions. Second operand has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 22 states have internal predecessors, (191), 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-18 21:52:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 21:52:18,358 INFO L93 Difference]: Finished difference Result 7653 states and 10201 transitions. [2023-12-18 21:52:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-18 21:52:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 22 states have internal predecessors, (191), 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 72 [2023-12-18 21:52:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 21:52:18,367 INFO L225 Difference]: With dead ends: 7653 [2023-12-18 21:52:18,367 INFO L226 Difference]: Without dead ends: 7635 [2023-12-18 21:52:18,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2023-12-18 21:52:18,369 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 433 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-18 21:52:18,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1364 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-18 21:52:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2023-12-18 21:52:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 4227. [2023-12-18 21:52:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4227 states, 4226 states have (on average 1.369380028395646) internal successors, (5787), 4226 states have internal predecessors, (5787), 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-18 21:52:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4227 states to 4227 states and 5787 transitions. [2023-12-18 21:52:18,652 INFO L78 Accepts]: Start accepts. Automaton has 4227 states and 5787 transitions. Word has length 72 [2023-12-18 21:52:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 21:52:18,652 INFO L495 AbstractCegarLoop]: Abstraction has 4227 states and 5787 transitions. [2023-12-18 21:52:18,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 22 states have internal predecessors, (191), 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-18 21:52:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 5787 transitions. [2023-12-18 21:52:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-18 21:52:18,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 21:52:18,654 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:52:18,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-18 21:52:18,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-18 21:52:18,858 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 21:52:18,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 21:52:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 633292127, now seen corresponding path program 1 times [2023-12-18 21:52:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 21:52:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094444884] [2023-12-18 21:52:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 21:52:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 21:52:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 21:52:18,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 21:52:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 21:52:18,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 21:52:18,936 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 21:52:18,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-18 21:52:18,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-18 21:52:18,940 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 21:52:18,942 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 21:52:19,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:52:19 BoogieIcfgContainer [2023-12-18 21:52:19,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 21:52:19,012 INFO L158 Benchmark]: Toolchain (without parser) took 33221.51ms. Allocated memory was 185.6MB in the beginning and 715.1MB in the end (delta: 529.5MB). Free memory was 140.8MB in the beginning and 422.3MB in the end (delta: -281.5MB). Peak memory consumption was 248.7MB. Max. memory is 8.0GB. [2023-12-18 21:52:19,012 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 140.6MB in the beginning and 140.5MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 21:52:19,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.63ms. Allocated memory is still 185.6MB. Free memory was 140.5MB in the beginning and 127.2MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-18 21:52:19,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.56ms. Allocated memory is still 185.6MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-18 21:52:19,013 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 185.6MB. Free memory was 124.1MB in the beginning and 121.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-18 21:52:19,013 INFO L158 Benchmark]: RCFGBuilder took 423.18ms. Allocated memory is still 185.6MB. Free memory was 121.3MB in the beginning and 99.6MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-18 21:52:19,014 INFO L158 Benchmark]: TraceAbstraction took 32511.32ms. Allocated memory was 185.6MB in the beginning and 715.1MB in the end (delta: 529.5MB). Free memory was 99.3MB in the beginning and 422.3MB in the end (delta: -323.1MB). Peak memory consumption was 206.8MB. Max. memory is 8.0GB. [2023-12-18 21:52:19,016 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 140.6MB in the beginning and 140.5MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.63ms. Allocated memory is still 185.6MB. Free memory was 140.5MB in the beginning and 127.2MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.56ms. Allocated memory is still 185.6MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 185.6MB. Free memory was 124.1MB in the beginning and 121.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 423.18ms. Allocated memory is still 185.6MB. Free memory was 121.3MB in the beginning and 99.6MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 32511.32ms. Allocated memory was 185.6MB in the beginning and 715.1MB in the end (delta: 529.5MB). Free memory was 99.3MB in the beginning and 422.3MB in the end (delta: -323.1MB). Peak memory consumption was 206.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6899 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6899 mSDsluCounter, 12103 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9726 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8677 IncrementalHoareTripleChecker+Invalid, 9070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 2377 mSDtfsCounter, 8677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1688 GetRequests, 1215 SyntacticMatches, 14 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10456 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4227occurred in iteration=23, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 19478 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2270 ConstructedInterpolants, 11 QuantifiedInterpolants, 15576 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2069 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 42 InterpolantComputations, 16 PerfectInterpolantSequences, 1531/2353 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-18 21:52:19,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...