/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 17:07:49,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 17:07:49,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-25 17:07:49,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 17:07:49,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 17:07:49,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 17:07:49,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 17:07:49,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 17:07:49,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 17:07:49,598 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 17:07:49,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 17:07:49,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 17:07:49,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 17:07:49,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 17:07:49,600 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 17:07:49,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 17:07:49,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 17:07:49,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-25 17:07:49,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 17:07:49,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 17:07:49,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 17:07:49,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 17:07:49,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 17:07:49,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 17:07:49,601 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 17:07:49,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 17:07:49,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 17:07:49,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 17:07:49,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 17:07:49,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 17:07:49,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 17:07:49,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 17:07:49,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 17:07:49,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-25 17:07:49,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-25 17:07:49,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 17:07:49,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 17:07:49,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 17:07:49,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 17:07:49,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 17:07:49,604 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-25 17:07:49,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 17:07:49,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 17:07:49,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 17:07:49,798 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 17:07:49,799 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 17:07:49,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2023-12-25 17:07:50,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 17:07:50,876 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 17:07:50,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2023-12-25 17:07:50,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6b14497/644762444aae4a769854d524f1e64263/FLAG27a07a87f [2023-12-25 17:07:51,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6b14497/644762444aae4a769854d524f1e64263 [2023-12-25 17:07:51,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 17:07:51,298 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 17:07:51,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 17:07:51,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 17:07:51,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 17:07:51,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c7822d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51, skipping insertion in model container [2023-12-25 17:07:51,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,324 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 17:07:51,419 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2023-12-25 17:07:51,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 17:07:51,460 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 17:07:51,467 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2023-12-25 17:07:51,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 17:07:51,492 INFO L206 MainTranslator]: Completed translation [2023-12-25 17:07:51,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51 WrapperNode [2023-12-25 17:07:51,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 17:07:51,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 17:07:51,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 17:07:51,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 17:07:51,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,561 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 210 [2023-12-25 17:07:51,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 17:07:51,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 17:07:51,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 17:07:51,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 17:07:51,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,585 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-25 17:07:51,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 17:07:51,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 17:07:51,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 17:07:51,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 17:07:51,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (1/1) ... [2023-12-25 17:07:51,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 17:07:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:07:51,640 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-25 17:07:51,659 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-25 17:07:51,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 17:07:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-25 17:07:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 17:07:51,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 17:07:51,734 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 17:07:51,736 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 17:07:52,050 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 17:07:52,086 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 17:07:52,086 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 17:07:52,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:07:52 BoogieIcfgContainer [2023-12-25 17:07:52,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 17:07:52,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 17:07:52,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 17:07:52,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 17:07:52,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:07:51" (1/3) ... [2023-12-25 17:07:52,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654fa007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:07:52, skipping insertion in model container [2023-12-25 17:07:52,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:51" (2/3) ... [2023-12-25 17:07:52,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654fa007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:07:52, skipping insertion in model container [2023-12-25 17:07:52,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:07:52" (3/3) ... [2023-12-25 17:07:52,095 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2023-12-25 17:07:52,108 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 17:07:52,109 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 17:07:52,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 17:07:52,179 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;@2faf22cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 17:07:52,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 17:07:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 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-25 17:07:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 17:07:52,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:52,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:07:52,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:52,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1787280142, now seen corresponding path program 1 times [2023-12-25 17:07:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:52,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809162214] [2023-12-25 17:07:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:52,538 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-25 17:07:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809162214] [2023-12-25 17:07:52,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809162214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:52,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:07:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604455700] [2023-12-25 17:07:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:52,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:07:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:07:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:07:52,571 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 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 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-25 17:07:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:52,600 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2023-12-25 17:07:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:07:52,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-12-25 17:07:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:52,607 INFO L225 Difference]: With dead ends: 69 [2023-12-25 17:07:52,607 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 17:07:52,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:07:52,611 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:52,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:07:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 17:07:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 17:07:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 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-25 17:07:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2023-12-25 17:07:52,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 12 [2023-12-25 17:07:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:52,631 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-12-25 17:07:52,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-25 17:07:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2023-12-25 17:07:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-25 17:07:52,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:52,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:07:52,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-25 17:07:52,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:52,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -427165450, now seen corresponding path program 1 times [2023-12-25 17:07:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096626164] [2023-12-25 17:07:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:52,693 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-25 17:07:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096626164] [2023-12-25 17:07:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096626164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:07:52,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835794834] [2023-12-25 17:07:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:07:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:07:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:07:52,699 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-25 17:07:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:52,727 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2023-12-25 17:07:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:07:52,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-25 17:07:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:52,729 INFO L225 Difference]: With dead ends: 72 [2023-12-25 17:07:52,729 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 17:07:52,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:07:52,730 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:52,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:07:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 17:07:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-25 17:07:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 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-25 17:07:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2023-12-25 17:07:52,737 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 13 [2023-12-25 17:07:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:52,737 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2023-12-25 17:07:52,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-25 17:07:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2023-12-25 17:07:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 17:07:52,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:52,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:07:52,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-25 17:07:52,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:52,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash -567659480, now seen corresponding path program 1 times [2023-12-25 17:07:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123140804] [2023-12-25 17:07:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:52,927 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-25 17:07:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123140804] [2023-12-25 17:07:52,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123140804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:52,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:52,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:07:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987486822] [2023-12-25 17:07:52,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:52,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:07:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:52,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:07:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:07:52,929 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-25 17:07:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:52,999 INFO L93 Difference]: Finished difference Result 99 states and 148 transitions. [2023-12-25 17:07:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:07:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-12-25 17:07:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:53,002 INFO L225 Difference]: With dead ends: 99 [2023-12-25 17:07:53,002 INFO L226 Difference]: Without dead ends: 66 [2023-12-25 17:07:53,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:07:53,006 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 162 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:53,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 145 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:07:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-25 17:07:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2023-12-25 17:07:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 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-25 17:07:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2023-12-25 17:07:53,015 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 14 [2023-12-25 17:07:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:53,015 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2023-12-25 17:07:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-25 17:07:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2023-12-25 17:07:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 17:07:53,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:53,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:07:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-25 17:07:53,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:53,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 263696652, now seen corresponding path program 1 times [2023-12-25 17:07:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040074404] [2023-12-25 17:07:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040074404] [2023-12-25 17:07:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040074404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:07:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757697537] [2023-12-25 17:07:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 17:07:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 17:07:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:07:53,420 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-25 17:07:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:53,574 INFO L93 Difference]: Finished difference Result 150 states and 221 transitions. [2023-12-25 17:07:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 17:07:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-25 17:07:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:53,576 INFO L225 Difference]: With dead ends: 150 [2023-12-25 17:07:53,577 INFO L226 Difference]: Without dead ends: 117 [2023-12-25 17:07:53,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-25 17:07:53,582 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 164 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:53,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 434 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:07:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-25 17:07:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 51. [2023-12-25 17:07:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 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-25 17:07:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2023-12-25 17:07:53,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 33 [2023-12-25 17:07:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:53,596 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2023-12-25 17:07:53,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-25 17:07:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2023-12-25 17:07:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 17:07:53,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:53,596 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:53,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-25 17:07:53,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:53,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 840724560, now seen corresponding path program 1 times [2023-12-25 17:07:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612665966] [2023-12-25 17:07:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:53,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:53,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612665966] [2023-12-25 17:07:53,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612665966] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:07:53,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794081826] [2023-12-25 17:07:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:53,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:07:53,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:07:53,944 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-25 17:07:53,968 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-25 17:07:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:54,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-25 17:07:54,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:07:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:54,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 17:07:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794081826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:54,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 17:07:54,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2023-12-25 17:07:54,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071792575] [2023-12-25 17:07:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:54,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 17:07:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 17:07:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-12-25 17:07:54,348 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-25 17:07:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:54,626 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2023-12-25 17:07:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 17:07:54,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-25 17:07:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:54,627 INFO L225 Difference]: With dead ends: 164 [2023-12-25 17:07:54,628 INFO L226 Difference]: Without dead ends: 120 [2023-12-25 17:07:54,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-12-25 17:07:54,629 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 200 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:54,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 148 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 17:07:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-25 17:07:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2023-12-25 17:07:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 77 states have internal predecessors, (111), 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-25 17:07:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2023-12-25 17:07:54,636 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 34 [2023-12-25 17:07:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:54,636 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2023-12-25 17:07:54,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-25 17:07:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2023-12-25 17:07:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 17:07:54,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:54,638 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:54,646 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-25 17:07:54,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:07:54,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:54,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash -182209576, now seen corresponding path program 1 times [2023-12-25 17:07:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174986136] [2023-12-25 17:07:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:54,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174986136] [2023-12-25 17:07:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174986136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:55,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:07:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302321263] [2023-12-25 17:07:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:55,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 17:07:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:55,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 17:07:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:07:55,084 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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-25 17:07:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:55,257 INFO L93 Difference]: Finished difference Result 246 states and 348 transitions. [2023-12-25 17:07:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 17:07:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 35 [2023-12-25 17:07:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:55,261 INFO L225 Difference]: With dead ends: 246 [2023-12-25 17:07:55,261 INFO L226 Difference]: Without dead ends: 112 [2023-12-25 17:07:55,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 17:07:55,262 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 346 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:55,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 275 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:07:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-25 17:07:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2023-12-25 17:07:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 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-25 17:07:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 112 transitions. [2023-12-25 17:07:55,267 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 112 transitions. Word has length 35 [2023-12-25 17:07:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:55,267 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 112 transitions. [2023-12-25 17:07:55,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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-25 17:07:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2023-12-25 17:07:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 17:07:55,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:55,268 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-25 17:07:55,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:55,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1635793078, now seen corresponding path program 1 times [2023-12-25 17:07:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357606147] [2023-12-25 17:07:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357606147] [2023-12-25 17:07:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357606147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:55,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:55,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 17:07:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493130436] [2023-12-25 17:07:55,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:55,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 17:07:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:55,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 17:07:55,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 17:07:55,793 INFO L87 Difference]: Start difference. First operand 80 states and 112 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-25 17:07:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:56,048 INFO L93 Difference]: Finished difference Result 173 states and 246 transitions. [2023-12-25 17:07:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 17:07:56,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2023-12-25 17:07:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:56,049 INFO L225 Difference]: With dead ends: 173 [2023-12-25 17:07:56,049 INFO L226 Difference]: Without dead ends: 129 [2023-12-25 17:07:56,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-25 17:07:56,050 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 191 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:56,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 187 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:07:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-25 17:07:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2023-12-25 17:07:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 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-25 17:07:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2023-12-25 17:07:56,054 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 36 [2023-12-25 17:07:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:56,055 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2023-12-25 17:07:56,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-25 17:07:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2023-12-25 17:07:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 17:07:56,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:56,056 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:56,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-25 17:07:56,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:56,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1594429266, now seen corresponding path program 1 times [2023-12-25 17:07:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340763363] [2023-12-25 17:07:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340763363] [2023-12-25 17:07:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340763363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 17:07:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15808357] [2023-12-25 17:07:56,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:56,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 17:07:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 17:07:56,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-25 17:07:56,364 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-25 17:07:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:56,721 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2023-12-25 17:07:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 17:07:56,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2023-12-25 17:07:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:56,722 INFO L225 Difference]: With dead ends: 265 [2023-12-25 17:07:56,723 INFO L226 Difference]: Without dead ends: 221 [2023-12-25 17:07:56,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2023-12-25 17:07:56,723 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 308 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:56,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 426 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 17:07:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-25 17:07:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 146. [2023-12-25 17:07:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4137931034482758) internal successors, (205), 145 states have internal predecessors, (205), 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-25 17:07:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 205 transitions. [2023-12-25 17:07:56,730 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 205 transitions. Word has length 36 [2023-12-25 17:07:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:56,730 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 205 transitions. [2023-12-25 17:07:56,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-25 17:07:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 205 transitions. [2023-12-25 17:07:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 17:07:56,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:56,731 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:56,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-25 17:07:56,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:56,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash -395335856, now seen corresponding path program 1 times [2023-12-25 17:07:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:56,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670792500] [2023-12-25 17:07:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:57,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670792500] [2023-12-25 17:07:57,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670792500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:57,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:07:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156909170] [2023-12-25 17:07:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:57,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 17:07:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 17:07:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:07:57,179 INFO L87 Difference]: Start difference. First operand 146 states and 205 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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-25 17:07:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:57,384 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2023-12-25 17:07:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 17:07:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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 36 [2023-12-25 17:07:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:57,385 INFO L225 Difference]: With dead ends: 229 [2023-12-25 17:07:57,385 INFO L226 Difference]: Without dead ends: 181 [2023-12-25 17:07:57,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-25 17:07:57,385 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 167 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:57,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 129 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:07:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-25 17:07:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 152. [2023-12-25 17:07:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 151 states have internal predecessors, (213), 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-25 17:07:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 213 transitions. [2023-12-25 17:07:57,391 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 213 transitions. Word has length 36 [2023-12-25 17:07:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:57,391 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 213 transitions. [2023-12-25 17:07:57,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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-25 17:07:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 213 transitions. [2023-12-25 17:07:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 17:07:57,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:57,393 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:57,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-25 17:07:57,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:57,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 305728722, now seen corresponding path program 1 times [2023-12-25 17:07:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63871140] [2023-12-25 17:07:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:57,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63871140] [2023-12-25 17:07:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63871140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:57,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:07:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218632195] [2023-12-25 17:07:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:57,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 17:07:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:57,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 17:07:57,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:07:57,687 INFO L87 Difference]: Start difference. First operand 152 states and 213 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-25 17:07:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:57,783 INFO L93 Difference]: Finished difference Result 329 states and 473 transitions. [2023-12-25 17:07:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 17:07:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 36 [2023-12-25 17:07:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:57,784 INFO L225 Difference]: With dead ends: 329 [2023-12-25 17:07:57,785 INFO L226 Difference]: Without dead ends: 239 [2023-12-25 17:07:57,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-25 17:07:57,785 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 131 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:57,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 392 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:07:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-25 17:07:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 155. [2023-12-25 17:07:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4155844155844155) internal successors, (218), 154 states have internal predecessors, (218), 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-25 17:07:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 218 transitions. [2023-12-25 17:07:57,793 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 218 transitions. Word has length 36 [2023-12-25 17:07:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:57,793 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 218 transitions. [2023-12-25 17:07:57,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-25 17:07:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2023-12-25 17:07:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 17:07:57,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:57,794 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 17:07:57,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-25 17:07:57,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:57,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash -444157102, now seen corresponding path program 1 times [2023-12-25 17:07:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:57,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87381403] [2023-12-25 17:07:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87381403] [2023-12-25 17:07:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87381403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:07:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636794198] [2023-12-25 17:07:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:57,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:07:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:07:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:07:57,967 INFO L87 Difference]: Start difference. First operand 155 states and 218 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-25 17:07:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:58,007 INFO L93 Difference]: Finished difference Result 257 states and 358 transitions. [2023-12-25 17:07:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:07:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2023-12-25 17:07:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:58,008 INFO L225 Difference]: With dead ends: 257 [2023-12-25 17:07:58,008 INFO L226 Difference]: Without dead ends: 119 [2023-12-25 17:07:58,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:07:58,009 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 160 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:58,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:07:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-25 17:07:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2023-12-25 17:07:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 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-25 17:07:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2023-12-25 17:07:58,013 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 36 [2023-12-25 17:07:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:58,013 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2023-12-25 17:07:58,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-25 17:07:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2023-12-25 17:07:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 17:07:58,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:58,015 INFO L195 NwaCegarLoop]: trace histogram [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-25 17:07:58,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-25 17:07:58,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:58,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -515728102, now seen corresponding path program 1 times [2023-12-25 17:07:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593580328] [2023-12-25 17:07:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:07:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 17:07:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:07:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593580328] [2023-12-25 17:07:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593580328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:07:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:07:58,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:07:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448763083] [2023-12-25 17:07:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:07:58,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 17:07:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:07:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 17:07:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:07:58,424 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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-25 17:07:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:07:58,611 INFO L93 Difference]: Finished difference Result 167 states and 231 transitions. [2023-12-25 17:07:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 17:07:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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 37 [2023-12-25 17:07:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:07:58,613 INFO L225 Difference]: With dead ends: 167 [2023-12-25 17:07:58,613 INFO L226 Difference]: Without dead ends: 106 [2023-12-25 17:07:58,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-25 17:07:58,614 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 168 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:07:58,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 139 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:07:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-25 17:07:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2023-12-25 17:07:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 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-25 17:07:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2023-12-25 17:07:58,618 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 37 [2023-12-25 17:07:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:07:58,618 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2023-12-25 17:07:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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-25 17:07:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2023-12-25 17:07:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 17:07:58,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:07:58,620 INFO L195 NwaCegarLoop]: trace histogram [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-25 17:07:58,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-25 17:07:58,620 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:07:58,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:07:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2090295452, now seen corresponding path program 1 times [2023-12-25 17:07:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:07:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766279233] [2023-12-25 17:07:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:07:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:07:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 17:07:58,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 17:07:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 17:07:58,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-25 17:07:58,758 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 17:07:58,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 17:07:58,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-25 17:07:58,764 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:07:58,766 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 17:07:58,812 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-25 17:07:58,812 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-25 17:07:58,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:07:58 BoogieIcfgContainer [2023-12-25 17:07:58,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 17:07:58,823 INFO L158 Benchmark]: Toolchain (without parser) took 7524.70ms. Allocated memory was 205.5MB in the beginning and 399.5MB in the end (delta: 194.0MB). Free memory was 165.1MB in the beginning and 222.2MB in the end (delta: -57.1MB). Peak memory consumption was 137.4MB. Max. memory is 8.0GB. [2023-12-25 17:07:58,823 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 17:07:58,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.44ms. Allocated memory is still 205.5MB. Free memory was 165.1MB in the beginning and 151.6MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 17:07:58,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.40ms. Allocated memory is still 205.5MB. Free memory was 151.6MB in the beginning and 146.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 17:07:58,824 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 205.5MB. Free memory was 146.7MB in the beginning and 143.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 17:07:58,824 INFO L158 Benchmark]: RCFGBuilder took 484.47ms. Allocated memory is still 205.5MB. Free memory was 142.9MB in the beginning and 117.0MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-25 17:07:58,824 INFO L158 Benchmark]: TraceAbstraction took 6732.60ms. Allocated memory was 205.5MB in the beginning and 399.5MB in the end (delta: 194.0MB). Free memory was 116.3MB in the beginning and 222.2MB in the end (delta: -105.9MB). Peak memory consumption was 89.1MB. Max. memory is 8.0GB. [2023-12-25 17:07:58,825 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.08ms. Allocated memory is still 205.5MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.44ms. Allocated memory is still 205.5MB. Free memory was 165.1MB in the beginning and 151.6MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.40ms. Allocated memory is still 205.5MB. Free memory was 151.6MB in the beginning and 146.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 205.5MB. Free memory was 146.7MB in the beginning and 143.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 484.47ms. Allocated memory is still 205.5MB. Free memory was 142.9MB in the beginning and 117.0MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6732.60ms. Allocated memory was 205.5MB in the beginning and 399.5MB in the end (delta: 194.0MB). Free memory was 116.3MB in the beginning and 222.2MB in the end (delta: -105.9MB). Peak memory consumption was 89.1MB. 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: 21]: 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 bitwiseAnd at line 115. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_13 = 1; [L34] const SORT_3 var_19 = 7; [L35] const SORT_3 var_23 = 1; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, var_13=1, var_19=7, var_23=1, var_4=0] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, var_13=1, var_19=7, var_23=1, var_4=0] [L40] SORT_3 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_8_arg_1 = var_4; [L45] state_7 = init_8_arg_1 VAL [init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_4=0] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_9_arg_0 = state_5; [L52] SORT_3 var_9_arg_1 = state_7; [L53] SORT_1 var_9 = var_9_arg_0 > var_9_arg_1; [L54] SORT_1 var_10_arg_0 = var_9; [L55] SORT_1 var_10 = ~var_10_arg_0; [L56] SORT_1 var_14_arg_0 = var_10; [L57] SORT_1 var_14 = ~var_14_arg_0; [L58] SORT_1 var_15_arg_0 = var_13; [L59] SORT_1 var_15_arg_1 = var_14; VAL [init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15_arg_0=1, var_15_arg_1=0, var_19=7, var_23=1, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15_arg_0=1, var_15_arg_1=0, var_19=7, var_23=1, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L60] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L61] EXPR var_15 & mask_SORT_1 VAL [init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_19=7, var_23=1, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L61] var_15 = var_15 & mask_SORT_1 [L62] SORT_1 bad_16_arg_0 = var_15; [L63] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_16_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_7; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_23; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_18_arg_0 = state_5; [L72] SORT_3 var_18_arg_1 = state_7; [L73] SORT_1 var_18 = var_18_arg_0 > var_18_arg_1; [L74] SORT_3 var_20_arg_0 = state_7; [L75] SORT_3 var_20_arg_1 = var_19; [L76] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L77] SORT_1 var_21_arg_0 = var_18; [L78] SORT_1 var_21_arg_1 = var_20; VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21_arg_0=0, var_21_arg_1=1, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21_arg_0=0, var_21_arg_1=1, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L79] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L80] EXPR var_21 & mask_SORT_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L80] var_21 = var_21 & mask_SORT_1 [L81] SORT_1 var_22_arg_0 = var_21; [L82] SORT_3 var_22_arg_1 = state_5; [L83] SORT_3 var_22_arg_2 = state_7; [L84] SORT_3 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_22; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L89] EXPR var_26 & mask_SORT_3 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_7; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_7; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_7; [L98] SORT_3 var_30_arg_1 = var_19; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_7; [L105] SORT_3 var_28_arg_1 = var_23; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_7; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_28=1, var_28_arg_0=0, var_28_arg_1=1, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_32=1, var_32_arg_0=1, var_32_arg_1=1, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_34=1, var_34_arg_0=0, var_34_arg_1=0, var_34_arg_2=1, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, state_5=0, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_28=1, var_28_arg_0=0, var_28_arg_1=1, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_32=1, var_32_arg_0=1, var_32_arg_1=1, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_34=1, var_34_arg_0=0, var_34_arg_1=0, var_34_arg_2=1, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_7 = next_35_arg_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, next_35_arg_1=0, state_5=1, state_7=0, var_10=255, var_10_arg_0=0, var_13=1, var_14=0, var_14_arg_0=255, var_15=0, var_15_arg_0=1, var_15_arg_1=0, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_28=1, var_28_arg_0=0, var_28_arg_1=1, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_32=1, var_32_arg_0=1, var_32_arg_1=1, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_34=0, var_34_arg_0=0, var_34_arg_1=0, var_34_arg_2=1, var_4=0, var_9=0, var_9_arg_0=0, var_9_arg_1=0] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_9_arg_0 = state_5; [L52] SORT_3 var_9_arg_1 = state_7; [L53] SORT_1 var_9 = var_9_arg_0 > var_9_arg_1; [L54] SORT_1 var_10_arg_0 = var_9; [L55] SORT_1 var_10 = ~var_10_arg_0; [L56] SORT_1 var_14_arg_0 = var_10; [L57] SORT_1 var_14 = ~var_14_arg_0; [L58] SORT_1 var_15_arg_0 = var_13; [L59] SORT_1 var_15_arg_1 = var_14; VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, next_35_arg_1=0, state_5=1, state_7=0, var_10=254, var_10_arg_0=1, var_13=1, var_14=1, var_14_arg_0=254, var_15=0, var_15_arg_0=1, var_15_arg_1=1, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_28=1, var_28_arg_0=0, var_28_arg_1=1, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_32=1, var_32_arg_0=1, var_32_arg_1=1, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_34=0, var_34_arg_0=0, var_34_arg_1=0, var_34_arg_2=1, var_4=0, var_9=1, var_9_arg_0=1, var_9_arg_1=0] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, next_35_arg_1=0, state_5=1, state_7=0, var_10=254, var_10_arg_0=1, var_13=1, var_14=1, var_14_arg_0=254, var_15=0, var_15_arg_0=1, var_15_arg_1=1, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_28=1, var_28_arg_0=0, var_28_arg_1=1, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_32=1, var_32_arg_0=1, var_32_arg_1=1, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_34=0, var_34_arg_0=0, var_34_arg_1=0, var_34_arg_2=1, var_4=0, var_9=1, var_9_arg_0=1, var_9_arg_1=0] [L60] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L61] EXPR var_15 & mask_SORT_1 VAL [bad_16_arg_0=0, init_6_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_3=7, msb_SORT_1=1, msb_SORT_3=4, next_27_arg_1=1, next_35_arg_1=0, state_5=1, state_7=0, var_10=254, var_10_arg_0=1, var_13=1, var_14=1, var_14_arg_0=254, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_18=0, var_18_arg_0=0, var_18_arg_1=0, var_19=7, var_20=1, var_20_arg_0=0, var_20_arg_1=7, var_21=1, var_21_arg_0=0, var_21_arg_1=1, var_22=0, var_22_arg_0=1, var_22_arg_1=0, var_22_arg_2=0, var_23=1, var_24=1, var_24_arg_0=0, var_24_arg_1=1, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=1, var_26_arg_0=1, var_26_arg_1=1, var_26_arg_2=0, var_28=1, var_28_arg_0=0, var_28_arg_1=1, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_30=1, var_30_arg_0=0, var_30_arg_1=7, var_31=1, var_31_arg_0=1, var_31_arg_1=1, var_32=1, var_32_arg_0=1, var_32_arg_1=1, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_34=0, var_34_arg_0=0, var_34_arg_1=0, var_34_arg_2=1, var_4=0, var_9=1, var_9_arg_0=1, var_9_arg_1=0] [L61] var_15 = var_15 & mask_SORT_1 [L62] SORT_1 bad_16_arg_0 = var_15; [L63] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1999 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1999 mSDsluCounter, 2731 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2096 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 635 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=10, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 422 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 2439 SizeOfPredicates, 11 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 56/60 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-25 17:07:58,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...