/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.h_b07.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:30:02,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:30:03,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:30:03,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:30:03,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:30:03,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:30:03,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:30:03,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:30:03,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:30:03,091 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:30:03,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:30:03,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:30:03,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:30:03,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:30:03,093 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:30:03,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:30:03,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:30:03,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:30:03,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:30:03,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:30:03,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:30:03,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:30:03,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:30:03,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:30:03,096 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:30:03,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:30:03,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:30:03,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:30:03,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:30:03,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:30:03,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:30:03,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:30:03,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:30:03,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-16 19:30:03,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:30:03,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:30:03,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:30:03,298 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:30:03,298 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:30:03,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b07.c [2023-12-16 19:30:04,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:30:04,426 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:30:04,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b07.c [2023-12-16 19:30:04,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cfa09759/35497f62cce44c61b5d948c24a587e14/FLAG12c927ac5 [2023-12-16 19:30:04,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cfa09759/35497f62cce44c61b5d948c24a587e14 [2023-12-16 19:30:04,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:30:04,447 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:30:04,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:30:04,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:30:04,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:30:04,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af5b9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04, skipping insertion in model container [2023-12-16 19:30:04,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,471 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:30:04,576 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.h_b07.c[1245,1258] [2023-12-16 19:30:04,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:30:04,617 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:30:04,625 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.h_b07.c[1245,1258] [2023-12-16 19:30:04,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:30:04,652 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:30:04,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04 WrapperNode [2023-12-16 19:30:04,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:30:04,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:30:04,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:30:04,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:30:04,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,695 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 191 [2023-12-16 19:30:04,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:30:04,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:30:04,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:30:04,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:30:04,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,726 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-16 19:30:04,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:30:04,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:30:04,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:30:04,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:30:04,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (1/1) ... [2023-12-16 19:30:04,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:30:04,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:04,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 19:30:04,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 19:30:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:30:04,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:30:04,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:30:04,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:30:04,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:30:04,876 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:30:04,878 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:30:05,112 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:30:05,132 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:30:05,132 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:30:05,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:30:05 BoogieIcfgContainer [2023-12-16 19:30:05,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:30:05,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:30:05,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:30:05,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:30:05,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:30:04" (1/3) ... [2023-12-16 19:30:05,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc6ff01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:30:05, skipping insertion in model container [2023-12-16 19:30:05,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:04" (2/3) ... [2023-12-16 19:30:05,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc6ff01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:30:05, skipping insertion in model container [2023-12-16 19:30:05,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:30:05" (3/3) ... [2023-12-16 19:30:05,139 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b07.c [2023-12-16 19:30:05,151 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:30:05,151 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:30:05,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:30:05,194 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;@133ac1b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:30:05,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:30:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 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-16 19:30:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 19:30:05,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:05,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:05,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:05,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1660510916, now seen corresponding path program 1 times [2023-12-16 19:30:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385789753] [2023-12-16 19:30:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:05,701 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-16 19:30:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385789753] [2023-12-16 19:30:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385789753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002673679] [2023-12-16 19:30:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:05,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:05,738 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 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 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 19:30:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:05,787 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2023-12-16 19:30:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2023-12-16 19:30:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:05,794 INFO L225 Difference]: With dead ends: 51 [2023-12-16 19:30:05,794 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 19:30:05,796 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-16 19:30:05,799 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:05,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 19:30:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 19:30:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-12-16 19:30:05,824 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2023-12-16 19:30:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:05,825 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-12-16 19:30:05,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 19:30:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2023-12-16 19:30:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 19:30:05,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:05,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:05,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:30:05,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:05,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -61984554, now seen corresponding path program 1 times [2023-12-16 19:30:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913019735] [2023-12-16 19:30:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:05,943 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-16 19:30:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913019735] [2023-12-16 19:30:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913019735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475868586] [2023-12-16 19:30:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:05,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:05,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:05,949 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-16 19:30:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:05,974 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2023-12-16 19:30:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-16 19:30:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:05,976 INFO L225 Difference]: With dead ends: 54 [2023-12-16 19:30:05,976 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 19:30:05,976 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-16 19:30:05,977 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:05,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 19:30:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-16 19:30:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 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-16 19:30:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-12-16 19:30:05,985 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 17 [2023-12-16 19:30:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:05,985 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-12-16 19:30:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-16 19:30:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2023-12-16 19:30:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 19:30:05,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:05,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:05,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:30:05,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:05,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2133741028, now seen corresponding path program 1 times [2023-12-16 19:30:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124827289] [2023-12-16 19:30:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:06,214 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-16 19:30:06,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:06,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124827289] [2023-12-16 19:30:06,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124827289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:06,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488282893] [2023-12-16 19:30:06,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:06,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:06,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:06,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:06,216 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-16 19:30:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:06,280 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2023-12-16 19:30:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:30:06,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2023-12-16 19:30:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:06,282 INFO L225 Difference]: With dead ends: 62 [2023-12-16 19:30:06,282 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 19:30:06,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:06,286 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:06,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 102 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 19:30:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-12-16 19:30:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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-16 19:30:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-12-16 19:30:06,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 18 [2023-12-16 19:30:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-12-16 19:30:06,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-16 19:30:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-12-16 19:30:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 19:30:06,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:06,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:06,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:30:06,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:06,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash -358733666, now seen corresponding path program 1 times [2023-12-16 19:30:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843890691] [2023-12-16 19:30:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:06,558 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-16 19:30:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843890691] [2023-12-16 19:30:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843890691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:06,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:30:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73107379] [2023-12-16 19:30:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:06,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:30:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:30:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:06,559 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-16 19:30:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:06,671 INFO L93 Difference]: Finished difference Result 58 states and 82 transitions. [2023-12-16 19:30:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:30:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2023-12-16 19:30:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:06,672 INFO L225 Difference]: With dead ends: 58 [2023-12-16 19:30:06,673 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 19:30:06,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:30:06,680 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:06,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 19:30:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2023-12-16 19:30:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 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-16 19:30:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2023-12-16 19:30:06,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 18 [2023-12-16 19:30:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:06,687 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-12-16 19:30:06,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-16 19:30:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2023-12-16 19:30:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 19:30:06,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:06,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:06,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:30:06,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:06,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -358793248, now seen corresponding path program 1 times [2023-12-16 19:30:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175762628] [2023-12-16 19:30:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:30:06,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:30:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:30:06,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:30:06,746 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:30:06,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:30:06,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:30:06,751 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 19:30:06,754 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:30:06,787 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:30:06,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:30:06 BoogieIcfgContainer [2023-12-16 19:30:06,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:30:06,797 INFO L158 Benchmark]: Toolchain (without parser) took 2349.22ms. Allocated memory is still 244.3MB. Free memory was 191.6MB in the beginning and 155.4MB in the end (delta: 36.2MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. [2023-12-16 19:30:06,797 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory was 149.9MB in the beginning and 149.8MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:30:06,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.81ms. Allocated memory is still 244.3MB. Free memory was 191.1MB in the beginning and 178.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 19:30:06,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 244.3MB. Free memory was 178.5MB in the beginning and 174.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 19:30:06,798 INFO L158 Benchmark]: Boogie Preprocessor took 44.03ms. Allocated memory is still 244.3MB. Free memory was 174.3MB in the beginning and 171.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 19:30:06,798 INFO L158 Benchmark]: RCFGBuilder took 393.08ms. Allocated memory is still 244.3MB. Free memory was 171.7MB in the beginning and 149.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 19:30:06,798 INFO L158 Benchmark]: TraceAbstraction took 1661.05ms. Allocated memory is still 244.3MB. Free memory was 148.6MB in the beginning and 155.4MB in the end (delta: -6.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:30:06,799 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.10ms. Allocated memory is still 203.4MB. Free memory was 149.9MB in the beginning and 149.8MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.81ms. Allocated memory is still 244.3MB. Free memory was 191.1MB in the beginning and 178.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 244.3MB. Free memory was 178.5MB in the beginning and 174.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.03ms. Allocated memory is still 244.3MB. Free memory was 174.3MB in the beginning and 171.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.08ms. Allocated memory is still 244.3MB. Free memory was 171.7MB in the beginning and 149.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1661.05ms. Allocated memory is still 244.3MB. Free memory was 148.6MB in the beginning and 155.4MB in the end (delta: -6.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 85. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 4); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (4 - 1); [L38] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 7); [L39] const SORT_29 msb_SORT_29 = (SORT_29)1 << (7 - 1); [L41] const SORT_4 var_5 = 0; [L42] const SORT_8 var_10 = 148; [L43] const SORT_1 var_14 = 1; [L44] const SORT_1 var_26 = 0; [L46] SORT_1 input_2; [L47] SORT_1 input_3; [L48] SORT_4 input_18; [L49] SORT_4 input_20; [L50] SORT_22 input_23; [L51] SORT_29 input_30; [L52] SORT_29 input_32; [L53] SORT_1 input_36; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, var_10=148, var_14=1, var_26=0, var_5=0] [L55] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_6=0, var_10=148, var_14=1, var_26=0, var_5=0] [L56] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] SORT_4 init_7_arg_1 = var_5; [L59] state_6 = init_7_arg_1 [L60] SORT_1 init_28_arg_1 = var_26; [L61] state_27 = init_28_arg_1 VAL [init_28_arg_1=0, init_7_arg_1=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_14=1, var_26=0, var_5=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] EXPR input_2 & mask_SORT_1 VAL [init_28_arg_1=0, init_7_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_14=1, var_26=0, var_5=0] [L65] input_2 = input_2 & mask_SORT_1 [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_18 = __VERIFIER_nondet_uchar() [L68] input_20 = __VERIFIER_nondet_uchar() [L69] input_23 = __VERIFIER_nondet_uchar() [L70] input_30 = __VERIFIER_nondet_uchar() [L71] input_32 = __VERIFIER_nondet_uchar() [L72] input_36 = __VERIFIER_nondet_uchar() [L75] SORT_4 var_9_arg_0 = state_6; VAL [init_28_arg_1=0, init_7_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_14=1, var_26=0, var_5=0, var_9_arg_0=0] [L76] EXPR var_9_arg_0 & mask_SORT_4 VAL [init_28_arg_1=0, init_7_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_14=1, var_26=0, var_5=0, var_9_arg_0=0] [L76] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L77] SORT_8 var_9 = var_9_arg_0; [L78] SORT_8 var_11_arg_0 = var_9; [L79] SORT_8 var_11_arg_1 = var_10; [L80] SORT_1 var_11 = var_11_arg_0 != var_11_arg_1; [L81] SORT_1 var_15_arg_0 = var_11; [L82] SORT_1 var_15 = ~var_15_arg_0; [L83] SORT_1 var_16_arg_0 = var_14; [L84] SORT_1 var_16_arg_1 = var_15; VAL [init_28_arg_1=0, init_7_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_11=1, var_11_arg_0=0, var_11_arg_1=148, var_14=1, var_15=254, var_15_arg_0=1, var_16_arg_0=1, var_16_arg_1=254, var_26=0, var_5=0, var_9=0, var_9_arg_0=0] [L85] EXPR var_16_arg_0 & var_16_arg_1 VAL [init_28_arg_1=0, init_7_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_11=1, var_11_arg_0=0, var_11_arg_1=148, var_14=1, var_15=254, var_15_arg_0=1, var_16_arg_0=1, var_16_arg_1=254, var_26=0, var_5=0, var_9=0, var_9_arg_0=0] [L85] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L86] EXPR var_16 & mask_SORT_1 VAL [init_28_arg_1=0, init_7_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_22=15, mask_SORT_29=127, mask_SORT_4=255, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_22=8, msb_SORT_29=64, msb_SORT_4=128, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=148, var_11=1, var_11_arg_0=0, var_11_arg_1=148, var_14=1, var_15=254, var_15_arg_0=1, var_16=1, var_16_arg_0=1, var_16_arg_1=254, var_26=0, var_5=0, var_9=0, var_9_arg_0=0] [L86] var_16 = var_16 & mask_SORT_1 [L87] SORT_1 bad_17_arg_0 = var_16; [L88] CALL __VERIFIER_assert(!(bad_17_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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 400 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 144 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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-16 19:30:06,812 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...