/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.cal57.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:13:09,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:13:10,048 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:13:10,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:13:10,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:13:10,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:13:10,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:13:10,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:13:10,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:13:10,066 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:13:10,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:13:10,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:13:10,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:13:10,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:13:10,068 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:13:10,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:13:10,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:13:10,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:13:10,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:13:10,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:13:10,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:13:10,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:13:10,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:13:10,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:13:10,081 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:13:10,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:13:10,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:13:10,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:13:10,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:13:10,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:13:10,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:13:10,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:13:10,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:13:10,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:13:10,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:13:10,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:13:10,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:13:10,083 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:13:10,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:13:10,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:13:10,083 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:13:10,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:13:10,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:13:10,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:13:10,241 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:13:10,242 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:13:10,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal57.c [2023-12-16 19:13:11,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:13:11,494 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:13:11,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal57.c [2023-12-16 19:13:11,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0385b5f2e/0e55f0c4ddc74ceda8b7fdf90af5df27/FLAG4f82b8634 [2023-12-16 19:13:11,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0385b5f2e/0e55f0c4ddc74ceda8b7fdf90af5df27 [2023-12-16 19:13:11,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:13:11,514 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:13:11,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:13:11,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:13:11,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:13:11,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5626e5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11, skipping insertion in model container [2023-12-16 19:13:11,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:13:11,636 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.cal57.c[1245,1258] [2023-12-16 19:13:11,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:13:11,700 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:13:11,709 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.cal57.c[1245,1258] [2023-12-16 19:13:11,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:13:11,748 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:13:11,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11 WrapperNode [2023-12-16 19:13:11,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:13:11,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:13:11,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:13:11,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:13:11,754 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:13:11" (1/1) ... [2023-12-16 19:13:11,763 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:13:11" (1/1) ... [2023-12-16 19:13:11,808 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 326 [2023-12-16 19:13:11,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:13:11,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:13:11,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:13:11,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:13:11,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,842 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:13:11,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:13:11,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:13:11,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:13:11,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:13:11,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (1/1) ... [2023-12-16 19:13:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:13:11,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:13:11,900 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:13:11,964 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:13:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:13:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:13:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:13:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:13:11,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:13:12,063 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:13:12,065 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:13:12,371 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:13:12,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:13:12,389 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:13:12,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:13:12 BoogieIcfgContainer [2023-12-16 19:13:12,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:13:12,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:13:12,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:13:12,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:13:12,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:13:11" (1/3) ... [2023-12-16 19:13:12,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354bdfff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:13:12, skipping insertion in model container [2023-12-16 19:13:12,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:11" (2/3) ... [2023-12-16 19:13:12,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354bdfff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:13:12, skipping insertion in model container [2023-12-16 19:13:12,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:13:12" (3/3) ... [2023-12-16 19:13:12,395 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2023-12-16 19:13:12,408 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:13:12,408 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:13:12,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:13:12,451 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;@1814f4af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:13:12,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:13:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 49 states have internal predecessors, (80), 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:13:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 19:13:12,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:12,464 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:13:12,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:12,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -927131471, now seen corresponding path program 1 times [2023-12-16 19:13:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:12,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307925560] [2023-12-16 19:13:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:12,978 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:13:12,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:12,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307925560] [2023-12-16 19:13:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307925560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:12,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156991912] [2023-12-16 19:13:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:13:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:13:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:13:13,018 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 49 states have internal predecessors, (80), 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:13:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:13,079 INFO L93 Difference]: Finished difference Result 87 states and 141 transitions. [2023-12-16 19:13:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:13:13,081 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:13:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:13,086 INFO L225 Difference]: With dead ends: 87 [2023-12-16 19:13:13,086 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 19:13:13,088 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:13:13,090 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 214 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:13:13,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 214 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 19:13:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-16 19:13:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 49 states have internal predecessors, (78), 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:13:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 78 transitions. [2023-12-16 19:13:13,130 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 78 transitions. Word has length 26 [2023-12-16 19:13:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:13,130 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 78 transitions. [2023-12-16 19:13:13,131 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:13:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 78 transitions. [2023-12-16 19:13:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 19:13:13,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:13,132 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:13:13,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:13:13,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:13,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1325420551, now seen corresponding path program 1 times [2023-12-16 19:13:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335528863] [2023-12-16 19:13:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:13,270 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:13:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:13,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335528863] [2023-12-16 19:13:13,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335528863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:13,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741473380] [2023-12-16 19:13:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:13,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:13:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:13:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:13:13,277 INFO L87 Difference]: Start difference. First operand 50 states and 78 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:13:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:13,312 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2023-12-16 19:13:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:13:13,312 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:13:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:13,314 INFO L225 Difference]: With dead ends: 90 [2023-12-16 19:13:13,336 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 19:13:13,337 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:13:13,338 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 212 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:13:13,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 212 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 19:13:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-12-16 19:13:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 51 states have internal predecessors, (80), 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:13:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2023-12-16 19:13:13,352 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 27 [2023-12-16 19:13:13,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:13,352 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2023-12-16 19:13:13,352 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:13:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2023-12-16 19:13:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 19:13:13,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:13,354 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:13:13,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:13:13,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:13,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash -297060851, now seen corresponding path program 1 times [2023-12-16 19:13:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:13,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157950834] [2023-12-16 19:13:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:13,594 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:13:13,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157950834] [2023-12-16 19:13:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157950834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:13,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:13,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:13,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073939286] [2023-12-16 19:13:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:13,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:13:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:13:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:13,598 INFO L87 Difference]: Start difference. First operand 52 states and 80 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:13:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:13,726 INFO L93 Difference]: Finished difference Result 143 states and 219 transitions. [2023-12-16 19:13:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:13:13,727 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:13:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:13,727 INFO L225 Difference]: With dead ends: 143 [2023-12-16 19:13:13,727 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 19:13:13,730 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:13:13,732 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 295 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:13,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 292 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 19:13:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2023-12-16 19:13:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 65 states have internal predecessors, (102), 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:13:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2023-12-16 19:13:13,743 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2023-12-16 19:13:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:13,743 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2023-12-16 19:13:13,743 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:13:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2023-12-16 19:13:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:13:13,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:13,744 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:13:13,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:13:13,744 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:13,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -729658193, now seen corresponding path program 1 times [2023-12-16 19:13:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645887027] [2023-12-16 19:13:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:13,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:13,973 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:13:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645887027] [2023-12-16 19:13:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645887027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:13:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443902139] [2023-12-16 19:13:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:13,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:13:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:13:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:13:13,975 INFO L87 Difference]: Start difference. First operand 66 states and 102 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:13:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:14,219 INFO L93 Difference]: Finished difference Result 175 states and 267 transitions. [2023-12-16 19:13:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:13:14,219 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:13:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:14,222 INFO L225 Difference]: With dead ends: 175 [2023-12-16 19:13:14,222 INFO L226 Difference]: Without dead ends: 136 [2023-12-16 19:13:14,224 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:13:14,228 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 483 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:14,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 461 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-16 19:13:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 69. [2023-12-16 19:13:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 68 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2023-12-16 19:13:14,239 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 29 [2023-12-16 19:13:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:14,239 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2023-12-16 19:13:14,239 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:13:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2023-12-16 19:13:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:13:14,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:14,240 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:13:14,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:13:14,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:14,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1122685203, now seen corresponding path program 1 times [2023-12-16 19:13:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803338932] [2023-12-16 19:13:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:13:14,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:13:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:13:14,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:13:14,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:13:14,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:13:14,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:13:14,305 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 19:13:14,307 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:13:14,328 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:13:14,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:13:14 BoogieIcfgContainer [2023-12-16 19:13:14,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:13:14,342 INFO L158 Benchmark]: Toolchain (without parser) took 2828.03ms. Allocated memory is still 368.1MB. Free memory was 307.2MB in the beginning and 170.3MB in the end (delta: 136.9MB). Peak memory consumption was 137.8MB. Max. memory is 8.0GB. [2023-12-16 19:13:14,342 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:13:14,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 368.1MB. Free memory was 306.9MB in the beginning and 292.4MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 19:13:14,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.67ms. Allocated memory is still 368.1MB. Free memory was 292.4MB in the beginning and 285.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 19:13:14,342 INFO L158 Benchmark]: Boogie Preprocessor took 58.91ms. Allocated memory is still 368.1MB. Free memory was 285.6MB in the beginning and 281.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 19:13:14,343 INFO L158 Benchmark]: RCFGBuilder took 520.33ms. Allocated memory is still 368.1MB. Free memory was 281.0MB in the beginning and 301.0MB in the end (delta: -20.0MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2023-12-16 19:13:14,343 INFO L158 Benchmark]: TraceAbstraction took 1950.74ms. Allocated memory is still 368.1MB. Free memory was 300.5MB in the beginning and 170.3MB in the end (delta: 130.2MB). Peak memory consumption was 130.2MB. Max. memory is 8.0GB. [2023-12-16 19:13:14,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 368.1MB. Free memory was 306.9MB in the beginning and 292.4MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.67ms. Allocated memory is still 368.1MB. Free memory was 292.4MB in the beginning and 285.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.91ms. Allocated memory is still 368.1MB. Free memory was 285.6MB in the beginning and 281.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 520.33ms. Allocated memory is still 368.1MB. Free memory was 281.0MB in the beginning and 301.0MB in the end (delta: -20.0MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1950.74ms. Allocated memory is still 368.1MB. Free memory was 300.5MB in the beginning and 170.3MB in the end (delta: 130.2MB). Peak memory consumption was 130.2MB. 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 96, overapproximation of bitwiseAnd at line 101. 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 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 1; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, var_11=0, var_15=0, var_21=1, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, var_11=0, var_15=0, var_21=1, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, var_11=0, var_15=0, var_21=1, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, var_11=0, var_15=0, var_21=1, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_26=0, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=0, var_27_arg_1=0, var_28_arg_0=255, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_26=0, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=0, var_27_arg_1=0, var_28_arg_0=255, var_28_arg_1=1, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_26=0, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=0, var_27_arg_1=0, var_28=0, var_28_arg_0=255, var_28_arg_1=1, var_31=1, var_32=255, var_32_arg_0=0, var_33_arg_0=1, var_33_arg_1=255] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_26=0, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=0, var_27_arg_1=0, var_28=0, var_28_arg_0=255, var_28_arg_1=1, var_31=1, var_32=255, var_32_arg_0=0, var_33_arg_0=1, var_33_arg_1=255] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_24_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=1, var_22=0, var_22_arg_0=0, var_22_arg_1=1, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_25_arg_2=0, var_26=0, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=0, var_27_arg_1=0, var_28=0, var_28_arg_0=255, var_28_arg_1=1, var_31=1, var_32=255, var_32_arg_0=0, var_33=1, var_33_arg_0=1, var_33_arg_1=255] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 780 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 780 mSDsluCounter, 1179 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 857 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 322 mSDtfsCounter, 124 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.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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, 106 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 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:13:14,373 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...