/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.cal25.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:10:53,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:10:53,991 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:10:53,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:10:53,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:10:54,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:10:54,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:10:54,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:10:54,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:10:54,017 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:10:54,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:10:54,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:10:54,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:10:54,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:10:54,019 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:10:54,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:10:54,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:10:54,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:10:54,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:10:54,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:10:54,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:10:54,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:10:54,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:10:54,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:10:54,030 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:10:54,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:10:54,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:10:54,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:10:54,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:10:54,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:10:54,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:10:54,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:10:54,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:10:54,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:10:54,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:10:54,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:10:54,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:10:54,034 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:10:54,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:10:54,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:10:54,034 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:10:54,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:10:54,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:10:54,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:10:54,310 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:10:54,312 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:10:54,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal25.c [2023-12-16 19:10:55,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:10:55,682 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:10:55,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal25.c [2023-12-16 19:10:55,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c52d01/f160d6ad1a7c495f8bdfbc7ed0261919/FLAGdf2923bc4 [2023-12-16 19:10:55,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c52d01/f160d6ad1a7c495f8bdfbc7ed0261919 [2023-12-16 19:10:55,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:10:55,708 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:10:55,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:10:55,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:10:55,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:10:55,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:55,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64735c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55, skipping insertion in model container [2023-12-16 19:10:55,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:55,755 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:10:55,875 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal25.c[1245,1258] [2023-12-16 19:10:55,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:10:55,932 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:10:55,942 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.cal25.c[1245,1258] [2023-12-16 19:10:55,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:10:55,983 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:10:55,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55 WrapperNode [2023-12-16 19:10:55,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:10:55,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:10:55,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:10:55,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:10:55,991 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:10:55" (1/1) ... [2023-12-16 19:10:56,001 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:10:55" (1/1) ... [2023-12-16 19:10:56,063 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 327 [2023-12-16 19:10:56,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:10:56,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:10:56,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:10:56,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:10:56,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,137 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:10:56,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:10:56,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:10:56,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:10:56,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:10:56,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (1/1) ... [2023-12-16 19:10:56,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:10:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:10:56,220 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:10:56,229 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:10:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:10:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:10:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:10:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:10:56,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:10:56,364 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:10:56,366 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:10:56,823 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:10:56,859 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:10:56,860 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:10:56,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:10:56 BoogieIcfgContainer [2023-12-16 19:10:56,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:10:56,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:10:56,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:10:56,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:10:56,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:10:55" (1/3) ... [2023-12-16 19:10:56,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcd574b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:10:56, skipping insertion in model container [2023-12-16 19:10:56,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:55" (2/3) ... [2023-12-16 19:10:56,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcd574b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:10:56, skipping insertion in model container [2023-12-16 19:10:56,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:10:56" (3/3) ... [2023-12-16 19:10:56,869 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal25.c [2023-12-16 19:10:56,881 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:10:56,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:10:56,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:10:56,930 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;@71f5cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:10:56,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:10:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 52 states have internal predecessors, (85), 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:10:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 19:10:56,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:10:56,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:10:56,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:10:56,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:10:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash -554893787, now seen corresponding path program 1 times [2023-12-16 19:10:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:10:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747428875] [2023-12-16 19:10:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:10:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:10:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:10:57,467 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:10:57,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:10:57,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747428875] [2023-12-16 19:10:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747428875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:10:57,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:10:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:10:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684454774] [2023-12-16 19:10:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:10:57,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:10:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:10:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:10:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:10:57,513 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 52 states have internal predecessors, (85), 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 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:10:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:10:57,576 INFO L93 Difference]: Finished difference Result 93 states and 151 transitions. [2023-12-16 19:10:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:10:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-16 19:10:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:10:57,584 INFO L225 Difference]: With dead ends: 93 [2023-12-16 19:10:57,585 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 19:10:57,588 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:10:57,592 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 229 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:10:57,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 229 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:10:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 19:10:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-16 19:10:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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:10:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2023-12-16 19:10:57,620 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 83 transitions. Word has length 26 [2023-12-16 19:10:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:10:57,620 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-12-16 19:10:57,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:10:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 83 transitions. [2023-12-16 19:10:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 19:10:57,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:10:57,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:10:57,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:10:57,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:10:57,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:10:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -20113133, now seen corresponding path program 1 times [2023-12-16 19:10:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:10:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680989382] [2023-12-16 19:10:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:10:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:10:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:10:57,748 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:10:57,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:10:57,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680989382] [2023-12-16 19:10:57,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680989382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:10:57,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:10:57,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:10:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351759604] [2023-12-16 19:10:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:10:57,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:10:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:10:57,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:10:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:10:57,754 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:10:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:10:57,799 INFO L93 Difference]: Finished difference Result 96 states and 149 transitions. [2023-12-16 19:10:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:10:57,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-16 19:10:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:10:57,802 INFO L225 Difference]: With dead ends: 96 [2023-12-16 19:10:57,802 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 19:10:57,803 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:10:57,804 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 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:10:57,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:10:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 19:10:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2023-12-16 19:10:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 54 states have internal predecessors, (85), 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:10:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2023-12-16 19:10:57,815 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 27 [2023-12-16 19:10:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:10:57,816 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2023-12-16 19:10:57,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:10:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2023-12-16 19:10:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 19:10:57,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:10:57,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:10:57,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:10:57,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:10:57,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:10:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 941067905, now seen corresponding path program 1 times [2023-12-16 19:10:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:10:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610250642] [2023-12-16 19:10:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:10:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:10:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:10:58,226 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:10:58,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:10:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610250642] [2023-12-16 19:10:58,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610250642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:10:58,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:10:58,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:10:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960163011] [2023-12-16 19:10:58,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:10:58,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:10:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:10:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:10:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:10:58,237 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:10:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:10:58,411 INFO L93 Difference]: Finished difference Result 152 states and 234 transitions. [2023-12-16 19:10:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:10:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2023-12-16 19:10:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:10:58,413 INFO L225 Difference]: With dead ends: 152 [2023-12-16 19:10:58,413 INFO L226 Difference]: Without dead ends: 110 [2023-12-16 19:10:58,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:10:58,415 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 320 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:10:58,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 308 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:10:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-16 19:10:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 69. [2023-12-16 19:10:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 68 states have internal predecessors, (107), 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:10:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2023-12-16 19:10:58,430 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 28 [2023-12-16 19:10:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:10:58,430 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2023-12-16 19:10:58,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:10:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2023-12-16 19:10:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:10:58,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:10:58,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:10:58,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:10:58,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:10:58,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:10:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1002372421, now seen corresponding path program 1 times [2023-12-16 19:10:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:10:58,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314118557] [2023-12-16 19:10:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:10:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:10:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:10:58,663 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:10:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:10:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314118557] [2023-12-16 19:10:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314118557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:10:58,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:10:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:10:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138082546] [2023-12-16 19:10:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:10:58,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:10:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:10:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:10:58,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:10:58,666 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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:10:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:10:58,903 INFO L93 Difference]: Finished difference Result 187 states and 287 transitions. [2023-12-16 19:10:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:10:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2023-12-16 19:10:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:10:58,906 INFO L225 Difference]: With dead ends: 187 [2023-12-16 19:10:58,906 INFO L226 Difference]: Without dead ends: 145 [2023-12-16 19:10:58,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:10:58,915 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 533 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:10:58,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 485 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:10:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-16 19:10:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 72. [2023-12-16 19:10:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 71 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-16 19:10:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2023-12-16 19:10:58,922 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 29 [2023-12-16 19:10:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:10:58,922 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2023-12-16 19:10:58,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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:10:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2023-12-16 19:10:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:10:58,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:10:58,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:10:58,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:10:58,924 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:10:58,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:10:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1395399431, now seen corresponding path program 1 times [2023-12-16 19:10:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:10:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287087815] [2023-12-16 19:10:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:10:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:10:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:10:58,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:10:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:10:59,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:10:59,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:10:59,041 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:10:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:10:59,047 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 19:10:59,050 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:10:59,097 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:10:59,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:10:59 BoogieIcfgContainer [2023-12-16 19:10:59,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:10:59,111 INFO L158 Benchmark]: Toolchain (without parser) took 3402.95ms. Allocated memory is still 319.8MB. Free memory was 275.5MB in the beginning and 175.2MB in the end (delta: 100.3MB). Peak memory consumption was 101.4MB. Max. memory is 8.0GB. [2023-12-16 19:10:59,111 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:10:59,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.88ms. Allocated memory is still 319.8MB. Free memory was 275.5MB in the beginning and 260.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 19:10:59,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.05ms. Allocated memory is still 319.8MB. Free memory was 260.7MB in the beginning and 254.0MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 19:10:59,112 INFO L158 Benchmark]: Boogie Preprocessor took 105.39ms. Allocated memory is still 319.8MB. Free memory was 254.0MB in the beginning and 249.3MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 19:10:59,112 INFO L158 Benchmark]: RCFGBuilder took 690.05ms. Allocated memory is still 319.8MB. Free memory was 249.3MB in the beginning and 213.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-16 19:10:59,113 INFO L158 Benchmark]: TraceAbstraction took 2246.68ms. Allocated memory is still 319.8MB. Free memory was 213.1MB in the beginning and 175.2MB in the end (delta: 37.9MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2023-12-16 19:10:59,114 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.14ms. Allocated memory is still 185.6MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.88ms. Allocated memory is still 319.8MB. Free memory was 275.5MB in the beginning and 260.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.05ms. Allocated memory is still 319.8MB. Free memory was 260.7MB in the beginning and 254.0MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 105.39ms. Allocated memory is still 319.8MB. Free memory was 254.0MB in the beginning and 249.3MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 690.05ms. Allocated memory is still 319.8MB. Free memory was 249.3MB in the beginning and 213.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2246.68ms. Allocated memory is still 319.8MB. Free memory was 213.1MB in the beginning and 175.2MB in the end (delta: 37.9MB). Peak memory consumption was 39.5MB. 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 bitwiseOr at line 92, overapproximation of bitwiseAnd at line 97. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_40 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, var_10=0, var_14=0, var_29=1, var_40=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, var_10=0, var_14=0, var_29=1, var_40=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, var_10=0, var_14=0, var_29=1, var_40=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, var_10=0, var_14=0, var_29=1, var_40=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_40=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_40=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_40=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 0; VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_29=1, var_40=1] [L79] EXPR var_20 & mask_SORT_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_29=1, var_40=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 0; VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_29=1, var_40=1] [L86] EXPR var_24 & mask_SORT_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_29=1, var_40=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26_arg_0=255, var_26_arg_1=1, var_29=1, var_40=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26_arg_0=255, var_26_arg_1=1, var_29=1, var_40=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=0, var_26_arg_0=255, var_26_arg_1=1, var_29=1, var_30=255, var_30_arg_0=0, var_31_arg_0=1, var_31_arg_1=255, var_40=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=0, var_26_arg_0=255, var_26_arg_1=1, var_29=1, var_30=255, var_30_arg_0=0, var_31_arg_0=1, var_31_arg_1=255, var_40=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [init_12_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_22_arg_1=0, input_2=0, input_3=0, input_6=0, mask_SORT_1=1, mask_SORT_5=3, msb_SORT_1=1, msb_SORT_5=2, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_13=255, var_13_arg_0=0, var_14=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=0, var_20_arg_0=0, var_23=0, var_23_arg_0=0, var_23_arg_1=0, var_23_arg_2=0, var_24=0, var_24_arg_0=0, var_25=1, var_25_arg_0=0, var_25_arg_1=0, var_26=0, var_26_arg_0=255, var_26_arg_1=1, var_29=1, var_30=255, var_30_arg_0=0, var_31=1, var_31_arg_0=1, var_31_arg_1=255, var_40=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_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, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 855 mSDsluCounter, 1249 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 909 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 340 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 115 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 309 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:10:59,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...