/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 20:29:28,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 20:29:28,929 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 20:29:28,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 20:29:28,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 20:29:28,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 20:29:28,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 20:29:28,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 20:29:28,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 20:29:28,964 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 20:29:28,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 20:29:28,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 20:29:28,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 20:29:28,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 20:29:28,967 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 20:29:28,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 20:29:28,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 20:29:28,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 20:29:28,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 20:29:28,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 20:29:28,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 20:29:28,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 20:29:28,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 20:29:28,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 20:29:28,970 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 20:29:28,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 20:29:28,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 20:29:28,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 20:29:28,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 20:29:28,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 20:29:28,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 20:29:28,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 20:29:28,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 20:29:28,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 20:29:28,974 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 -> false [2023-12-16 20:29:29,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 20:29:29,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 20:29:29,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 20:29:29,206 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 20:29:29,210 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 20:29:29,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2023-12-16 20:29:30,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 20:29:30,640 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 20:29:30,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2023-12-16 20:29:30,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3415c8e/1766eb5a59214375a592ec16e2268a32/FLAG1ca0bb9ed [2023-12-16 20:29:30,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3415c8e/1766eb5a59214375a592ec16e2268a32 [2023-12-16 20:29:30,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 20:29:30,673 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 20:29:30,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 20:29:30,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 20:29:30,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 20:29:30,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:29:30" (1/1) ... [2023-12-16 20:29:30,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbe3b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:30, skipping insertion in model container [2023-12-16 20:29:30,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:29:30" (1/1) ... [2023-12-16 20:29:30,716 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 20:29:30,823 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.circular_pointer_top_w8_d8_e0.c[1278,1291] [2023-12-16 20:29:30,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 20:29:30,958 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 20:29:30,967 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.circular_pointer_top_w8_d8_e0.c[1278,1291] [2023-12-16 20:29:31,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 20:29:31,083 INFO L206 MainTranslator]: Completed translation [2023-12-16 20:29:31,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31 WrapperNode [2023-12-16 20:29:31,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 20:29:31,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 20:29:31,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 20:29:31,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 20:29:31,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,172 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 855 [2023-12-16 20:29:31,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 20:29:31,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 20:29:31,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 20:29:31,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 20:29:31,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,242 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 20:29:31,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 20:29:31,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 20:29:31,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 20:29:31,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 20:29:31,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (1/1) ... [2023-12-16 20:29:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 20:29:31,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 20:29:31,351 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 20:29:31,360 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 20:29:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 20:29:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 20:29:31,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 20:29:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 20:29:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 20:29:31,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 20:29:31,568 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 20:29:31,569 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 20:29:31,995 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 20:29:32,035 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 20:29:32,036 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 20:29:32,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:29:32 BoogieIcfgContainer [2023-12-16 20:29:32,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 20:29:32,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 20:29:32,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 20:29:32,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 20:29:32,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:29:30" (1/3) ... [2023-12-16 20:29:32,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446682ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:29:32, skipping insertion in model container [2023-12-16 20:29:32,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:29:31" (2/3) ... [2023-12-16 20:29:32,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446682ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:29:32, skipping insertion in model container [2023-12-16 20:29:32,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:29:32" (3/3) ... [2023-12-16 20:29:32,043 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2023-12-16 20:29:32,055 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 20:29:32,055 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 20:29:32,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 20:29:32,100 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;@2ad9a786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 20:29:32,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 20:29:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 20:29:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 20:29:32,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:29:32,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:29:32,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:29:32,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:29:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash -311484247, now seen corresponding path program 1 times [2023-12-16 20:29:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 20:29:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106284108] [2023-12-16 20:29:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:29:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 20:29:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:29:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 20:29:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:29:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 20:29:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:29:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 20:29:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:29:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 20:29:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 20:29:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106284108] [2023-12-16 20:29:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106284108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:29:32,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:29:32,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 20:29:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743254732] [2023-12-16 20:29:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:29:32,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 20:29:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 20:29:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 20:29:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 20:29:32,488 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 20:29:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:29:32,511 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2023-12-16 20:29:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 20:29:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-12-16 20:29:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:29:32,519 INFO L225 Difference]: With dead ends: 33 [2023-12-16 20:29:32,519 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 20:29:32,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 20:29:32,524 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:29:32,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:29:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 20:29:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 20:29:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 20:29:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-12-16 20:29:32,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 22 [2023-12-16 20:29:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:29:32,551 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-12-16 20:29:32,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 20:29:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-12-16 20:29:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 20:29:32,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:29:32,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:29:32,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 20:29:32,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:29:32,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:29:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1990205213, now seen corresponding path program 1 times [2023-12-16 20:29:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 20:29:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302648935] [2023-12-16 20:29:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:29:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 20:29:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 20:29:32,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 20:29:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 20:29:33,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 20:29:33,142 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 20:29:33,143 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 20:29:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 20:29:33,148 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-16 20:29:33,151 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 20:29:33,201 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 20:29:33,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:29:33 BoogieIcfgContainer [2023-12-16 20:29:33,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 20:29:33,222 INFO L158 Benchmark]: Toolchain (without parser) took 2548.80ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 135.5MB in the beginning and 107.3MB in the end (delta: 28.2MB). Peak memory consumption was 87.6MB. Max. memory is 8.0GB. [2023-12-16 20:29:33,223 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 20:29:33,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.90ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 105.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 20:29:33,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.50ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 97.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 20:29:33,226 INFO L158 Benchmark]: Boogie Preprocessor took 117.04ms. Allocated memory is still 184.5MB. Free memory was 97.4MB in the beginning and 146.6MB in the end (delta: -49.2MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2023-12-16 20:29:33,226 INFO L158 Benchmark]: RCFGBuilder took 736.13ms. Allocated memory is still 184.5MB. Free memory was 146.6MB in the beginning and 71.1MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2023-12-16 20:29:33,227 INFO L158 Benchmark]: TraceAbstraction took 1182.59ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 70.6MB in the beginning and 107.3MB in the end (delta: -36.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 20:29:33,230 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.11ms. Allocated memory is still 184.5MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.90ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 105.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 97.50ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 97.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 117.04ms. Allocated memory is still 184.5MB. Free memory was 97.4MB in the beginning and 146.6MB in the end (delta: -49.2MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * RCFGBuilder took 736.13ms. Allocated memory is still 184.5MB. Free memory was 146.6MB in the beginning and 71.1MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1182.59ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 70.6MB in the beginning and 107.3MB in the end (delta: -36.7MB). Peak memory consumption was 22.0MB. 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 bitwise operation at line 158. Possible FailurePath: [L26] EXPR (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1) [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] EXPR (SORT_1)1 << (1 - 1) [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] EXPR (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8) [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] EXPR (SORT_3)1 << (8 - 1) [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] EXPR (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 5) [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 5); [L33] EXPR (SORT_11)1 << (5 - 1) [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (5 - 1); [L35] EXPR (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4) [L35] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L36] EXPR (SORT_13)1 << (4 - 1) [L36] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L38] EXPR (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 3) [L38] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 3); [L39] EXPR (SORT_19)1 << (3 - 1) [L39] const SORT_19 msb_SORT_19 = (SORT_19)1 << (3 - 1); [L41] EXPR (SORT_40)-1 >> (sizeof(SORT_40) * 8 - 2) [L41] const SORT_40 mask_SORT_40 = (SORT_40)-1 >> (sizeof(SORT_40) * 8 - 2); [L42] EXPR (SORT_40)1 << (2 - 1) [L42] const SORT_40 msb_SORT_40 = (SORT_40)1 << (2 - 1); [L44] const SORT_13 var_15 = 8; [L45] const SORT_19 var_20 = 7; [L46] const SORT_19 var_25 = 6; [L47] const SORT_19 var_30 = 5; [L48] const SORT_19 var_35 = 4; [L49] const SORT_40 var_41 = 3; [L50] const SORT_40 var_46 = 2; [L51] const SORT_1 var_51 = 1; [L52] const SORT_13 var_64 = 9; [L53] const SORT_11 var_81 = 0; [L54] const SORT_1 var_111 = 0; [L55] const SORT_3 var_268 = 0; [L57] SORT_1 input_2; [L58] SORT_3 input_4; [L59] SORT_1 input_5; [L60] SORT_1 input_6; [L61] SORT_1 input_7; [L62] SORT_1 input_8; [L63] SORT_3 input_9; [L64] SORT_1 input_109; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L66] SORT_3 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 [L67] SORT_11 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L68] SORT_3 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L69] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L70] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L71] SORT_3 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L72] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L73] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L74] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L75] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 [L76] SORT_11 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L77] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L78] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 [L79] SORT_11 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L80] SORT_3 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L81] SORT_1 state_91 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 [L82] SORT_11 state_136 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L84] SORT_1 init_92_arg_1 = var_51; [L85] state_91 = init_92_arg_1 VAL [init_92_arg_1=1, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_64=9, var_81=0] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_4 = __VERIFIER_nondet_uchar() [L90] input_5 = __VERIFIER_nondet_uchar() [L91] input_6 = __VERIFIER_nondet_uchar() [L92] input_7 = __VERIFIER_nondet_uchar() [L93] EXPR input_7 & mask_SORT_1 [L93] input_7 = input_7 & mask_SORT_1 [L94] input_8 = __VERIFIER_nondet_uchar() [L95] input_9 = __VERIFIER_nondet_uchar() [L96] input_109 = __VERIFIER_nondet_uchar() [L98] SORT_1 var_93_arg_0 = input_7; [L99] SORT_1 var_93_arg_1 = state_91; [L100] SORT_1 var_93 = var_93_arg_0 == var_93_arg_1; [L101] SORT_1 var_94_arg_0 = var_51; [L102] SORT_1 var_94 = ~var_94_arg_0; [L103] SORT_1 var_95_arg_0 = var_93; [L104] SORT_1 var_95_arg_1 = var_94; [L105] EXPR var_95_arg_0 | var_95_arg_1 [L105] SORT_1 var_95 = var_95_arg_0 | var_95_arg_1; [L106] EXPR var_95 & mask_SORT_1 [L106] var_95 = var_95 & mask_SORT_1 [L107] SORT_1 constr_96_arg_0 = var_95; VAL [constr_96_arg_0=255, init_92_arg_1=1, input_7=0, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_64=9, var_81=0, var_93=0, var_93_arg_0=0, var_93_arg_1=1, var_94=254, var_94_arg_0=1, var_95=255, var_95_arg_0=0, var_95_arg_1=254] [L108] CALL assume_abort_if_not(constr_96_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L108] RET assume_abort_if_not(constr_96_arg_0) VAL [constr_96_arg_0=255, init_92_arg_1=1, input_7=0, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_64=9, var_81=0, var_93=0, var_93_arg_0=0, var_93_arg_1=1, var_94=254, var_94_arg_0=1, var_95=255, var_95_arg_0=0, var_95_arg_1=254] [L109] SORT_13 var_65_arg_0 = var_64; [L110] EXPR var_65_arg_0 & mask_SORT_13 [L110] var_65_arg_0 = var_65_arg_0 & mask_SORT_13 [L111] SORT_11 var_65 = var_65_arg_0; [L112] SORT_11 var_66_arg_0 = state_60; [L113] SORT_11 var_66_arg_1 = var_65; [L114] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L115] SORT_1 var_97_arg_0 = var_66; [L116] SORT_1 var_97 = ~var_97_arg_0; [L117] SORT_1 var_98_arg_0 = input_6; [L118] SORT_1 var_98 = ~var_98_arg_0; [L119] SORT_1 var_99_arg_0 = var_97; [L120] SORT_1 var_99_arg_1 = var_98; [L121] EXPR var_99_arg_0 | var_99_arg_1 [L121] SORT_1 var_99 = var_99_arg_0 | var_99_arg_1; [L122] SORT_1 var_100_arg_0 = var_51; [L123] SORT_1 var_100 = ~var_100_arg_0; [L124] SORT_1 var_101_arg_0 = var_99; [L125] SORT_1 var_101_arg_1 = var_100; [L126] EXPR var_101_arg_0 | var_101_arg_1 [L126] SORT_1 var_101 = var_101_arg_0 | var_101_arg_1; [L127] EXPR var_101 & mask_SORT_1 [L127] var_101 = var_101 & mask_SORT_1 [L128] SORT_1 constr_102_arg_0 = var_101; VAL [constr_102_arg_0=255, constr_96_arg_0=255, init_92_arg_1=1, input_6=0, input_7=0, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_100=254, var_100_arg_0=1, var_101=255, var_101_arg_0=253, var_101_arg_1=254, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_64=9, var_65=0, var_65_arg_0=0, var_66=0, var_66_arg_0=255, var_66_arg_1=0, var_81=0, var_93=0, var_93_arg_0=0, var_93_arg_1=1, var_94=254, var_94_arg_0=1, var_95=255, var_95_arg_0=0, var_95_arg_1=254, var_97=255, var_97_arg_0=0, var_98=255, var_98_arg_0=0, var_99=253, var_99_arg_0=255, var_99_arg_1=255] [L129] CALL assume_abort_if_not(constr_102_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L129] RET assume_abort_if_not(constr_102_arg_0) VAL [constr_102_arg_0=255, constr_96_arg_0=255, init_92_arg_1=1, input_6=0, input_7=0, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_100=254, var_100_arg_0=1, var_101=255, var_101_arg_0=253, var_101_arg_1=254, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_64=9, var_65=0, var_65_arg_0=0, var_66=0, var_66_arg_0=255, var_66_arg_1=0, var_81=0, var_93=0, var_93_arg_0=0, var_93_arg_1=1, var_94=254, var_94_arg_0=1, var_95=255, var_95_arg_0=0, var_95_arg_1=254, var_97=255, var_97_arg_0=0, var_98=255, var_98_arg_0=0, var_99=253, var_99_arg_0=255, var_99_arg_1=255] [L130] SORT_11 var_61_arg_0 = state_60; [L131] SORT_1 var_61 = var_61_arg_0 != 0; [L132] SORT_1 var_62_arg_0 = var_61; [L133] SORT_1 var_62 = ~var_62_arg_0; [L134] SORT_1 var_103_arg_0 = var_62; [L135] SORT_1 var_103 = ~var_103_arg_0; [L136] SORT_1 var_104_arg_0 = input_5; [L137] SORT_1 var_104 = ~var_104_arg_0; [L138] SORT_1 var_105_arg_0 = var_103; [L139] SORT_1 var_105_arg_1 = var_104; [L140] EXPR var_105_arg_0 | var_105_arg_1 [L140] SORT_1 var_105 = var_105_arg_0 | var_105_arg_1; [L141] SORT_1 var_106_arg_0 = var_51; [L142] SORT_1 var_106 = ~var_106_arg_0; [L143] SORT_1 var_107_arg_0 = var_105; [L144] SORT_1 var_107_arg_1 = var_106; [L145] EXPR var_107_arg_0 | var_107_arg_1 [L145] SORT_1 var_107 = var_107_arg_0 | var_107_arg_1; [L146] EXPR var_107 & mask_SORT_1 [L146] var_107 = var_107 & mask_SORT_1 [L147] SORT_1 constr_108_arg_0 = var_107; VAL [constr_102_arg_0=255, constr_108_arg_0=255, constr_96_arg_0=255, init_92_arg_1=1, input_5=0, input_6=0, input_7=0, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_100=254, var_100_arg_0=1, var_101=255, var_101_arg_0=253, var_101_arg_1=254, var_103=1, var_103_arg_0=254, var_104=255, var_104_arg_0=0, var_105=0, var_105_arg_0=1, var_105_arg_1=255, var_106=254, var_106_arg_0=1, var_107=255, var_107_arg_0=0, var_107_arg_1=254, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_61=1, var_61_arg_0=255, var_62=254, var_62_arg_0=1, var_64=9, var_65=0, var_65_arg_0=0, var_66=0, var_66_arg_0=255, var_66_arg_1=0, var_81=0, var_93=0, var_93_arg_0=0, var_93_arg_1=1, var_94=254, var_94_arg_0=1, var_95=255, var_95_arg_0=0, var_95_arg_1=254, var_97=255, var_97_arg_0=0, var_98=255, var_98_arg_0=0, var_99=253, var_99_arg_0=255, var_99_arg_1=255] [L148] CALL assume_abort_if_not(constr_108_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L148] RET assume_abort_if_not(constr_108_arg_0) VAL [constr_102_arg_0=255, constr_108_arg_0=255, constr_96_arg_0=255, init_92_arg_1=1, input_5=0, input_6=0, input_7=0, mask_SORT_11=0, mask_SORT_13=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_3=0, mask_SORT_40=0, msb_SORT_11=0, msb_SORT_13=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_3=0, msb_SORT_40=0, state_10=0, state_12=0, state_136=0, state_18=0, state_24=0, state_29=0, state_34=0, state_39=0, state_45=0, state_50=0, state_55=0, state_60=255, state_68=0, state_69=0, state_72=255, state_87=0, state_91=1, var_100=254, var_100_arg_0=1, var_101=255, var_101_arg_0=253, var_101_arg_1=254, var_103=1, var_103_arg_0=254, var_104=255, var_104_arg_0=0, var_105=0, var_105_arg_0=1, var_105_arg_1=255, var_106=254, var_106_arg_0=1, var_107=255, var_107_arg_0=0, var_107_arg_1=254, var_111=0, var_15=8, var_20=7, var_25=6, var_268=0, var_30=5, var_35=4, var_41=3, var_46=2, var_51=1, var_61=1, var_61_arg_0=255, var_62=254, var_62_arg_0=1, var_64=9, var_65=0, var_65_arg_0=0, var_66=0, var_66_arg_0=255, var_66_arg_1=0, var_81=0, var_93=0, var_93_arg_0=0, var_93_arg_1=1, var_94=254, var_94_arg_0=1, var_95=255, var_95_arg_0=0, var_95_arg_1=254, var_97=255, var_97_arg_0=0, var_98=255, var_98_arg_0=0, var_99=253, var_99_arg_0=255, var_99_arg_1=255] [L150] SORT_1 var_112_arg_0 = state_91; [L151] SORT_1 var_112_arg_1 = var_111; [L152] SORT_1 var_112_arg_2 = var_51; [L153] SORT_1 var_112 = var_112_arg_0 ? var_112_arg_1 : var_112_arg_2; [L154] SORT_1 var_70_arg_0 = state_69; [L155] SORT_1 var_70 = ~var_70_arg_0; [L156] SORT_1 var_71_arg_0 = state_68; [L157] SORT_1 var_71_arg_1 = var_70; [L158] EXPR var_71_arg_0 & var_71_arg_1 [L158] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L159] SORT_11 var_73_arg_0 = state_72; [L160] SORT_1 var_73 = var_73_arg_0 != 0; [L161] SORT_1 var_74_arg_0 = var_71; [L162] SORT_1 var_74_arg_1 = var_73; [L163] EXPR var_74_arg_0 & var_74_arg_1 [L163] SORT_1 var_74 = var_74_arg_0 & var_74_arg_1; [L164] SORT_1 var_75_arg_0 = state_68; [L165] SORT_1 var_75 = ~var_75_arg_0; [L166] SORT_1 var_76_arg_0 = input_6; [L167] SORT_1 var_76_arg_1 = var_75; [L168] EXPR var_76_arg_0 & var_76_arg_1 [L168] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L169] SORT_1 var_77_arg_0 = var_76; [L170] EXPR var_77_arg_0 & mask_SORT_1 [L170] var_77_arg_0 = var_77_arg_0 & mask_SORT_1 [L171] SORT_11 var_77 = var_77_arg_0; [L172] SORT_11 var_78_arg_0 = state_72; [L173] SORT_11 var_78_arg_1 = var_77; [L174] SORT_11 var_78 = var_78_arg_0 + var_78_arg_1; [L175] SORT_1 var_79_arg_0 = input_5; [L176] EXPR var_79_arg_0 & mask_SORT_1 [L176] var_79_arg_0 = var_79_arg_0 & mask_SORT_1 [L177] SORT_11 var_79 = var_79_arg_0; [L178] SORT_11 var_80_arg_0 = var_78; [L179] SORT_11 var_80_arg_1 = var_79; [L180] SORT_11 var_80 = var_80_arg_0 - var_80_arg_1; [L181] SORT_1 var_82_arg_0 = input_7; [L182] SORT_11 var_82_arg_1 = var_81; [L183] SORT_11 var_82_arg_2 = var_80; [L184] SORT_11 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L185] EXPR var_82 & mask_SORT_11 [L185] var_82 = var_82 & mask_SORT_11 [L186] SORT_11 var_83_arg_0 = var_82; [L187] SORT_1 var_83 = var_83_arg_0 != 0; [L188] SORT_1 var_84_arg_0 = var_83; [L189] SORT_1 var_84 = ~var_84_arg_0; [L190] SORT_1 var_85_arg_0 = var_74; [L191] SORT_1 var_85_arg_1 = var_84; [L192] EXPR var_85_arg_0 & var_85_arg_1 [L192] SORT_1 var_85 = var_85_arg_0 & var_85_arg_1; [L193] SORT_1 var_86_arg_0 = var_85; [L194] SORT_1 var_86 = ~var_86_arg_0; [L195] SORT_11 var_14_arg_0 = state_12; [L196] EXPR var_14_arg_0 >> 0 [L196] SORT_13 var_14 = var_14_arg_0 >> 0; [L197] EXPR var_14 & mask_SORT_13 [L197] var_14 = var_14 & mask_SORT_13 [L198] SORT_13 var_56_arg_0 = var_14; [L199] SORT_1 var_56 = var_56_arg_0 != 0; [L200] SORT_1 var_57_arg_0 = var_56; [L201] SORT_1 var_57 = ~var_57_arg_0; [L202] EXPR var_57 & mask_SORT_1 [L202] var_57 = var_57 & mask_SORT_1 [L203] SORT_1 var_52_arg_0 = var_51; [L204] EXPR var_52_arg_0 & mask_SORT_1 [L204] var_52_arg_0 = var_52_arg_0 & mask_SORT_1 [L205] SORT_13 var_52 = var_52_arg_0; [L206] SORT_13 var_53_arg_0 = var_14; [L207] SORT_13 var_53_arg_1 = var_52; [L208] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L209] SORT_40 var_47_arg_0 = var_46; [L210] EXPR var_47_arg_0 & mask_SORT_40 [L210] var_47_arg_0 = var_47_arg_0 & mask_SORT_40 [L211] SORT_13 var_47 = var_47_arg_0; [L212] SORT_13 var_48_arg_0 = var_14; [L213] SORT_13 var_48_arg_1 = var_47; [L214] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L215] SORT_40 var_42_arg_0 = var_41; [L216] EXPR var_42_arg_0 & mask_SORT_40 [L216] var_42_arg_0 = var_42_arg_0 & mask_SORT_40 [L217] SORT_13 var_42 = var_42_arg_0; [L218] SORT_13 var_43_arg_0 = var_14; [L219] SORT_13 var_43_arg_1 = var_42; [L220] SORT_1 var_43 = var_43_arg_0 == var_43_arg_1; [L221] SORT_19 var_36_arg_0 = var_35; [L222] EXPR var_36_arg_0 & mask_SORT_19 [L222] var_36_arg_0 = var_36_arg_0 & mask_SORT_19 [L223] SORT_13 var_36 = var_36_arg_0; [L224] SORT_13 var_37_arg_0 = var_14; [L225] SORT_13 var_37_arg_1 = var_36; [L226] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L227] SORT_19 var_31_arg_0 = var_30; [L228] EXPR var_31_arg_0 & mask_SORT_19 [L228] var_31_arg_0 = var_31_arg_0 & mask_SORT_19 [L229] SORT_13 var_31 = var_31_arg_0; [L230] SORT_13 var_32_arg_0 = var_14; [L231] SORT_13 var_32_arg_1 = var_31; [L232] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L233] SORT_19 var_26_arg_0 = var_25; [L234] EXPR var_26_arg_0 & mask_SORT_19 [L234] var_26_arg_0 = var_26_arg_0 & mask_SORT_19 [L235] SORT_13 var_26 = var_26_arg_0; [L236] SORT_13 var_27_arg_0 = var_14; [L237] SORT_13 var_27_arg_1 = var_26; [L238] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L239] SORT_19 var_21_arg_0 = var_20; [L240] EXPR var_21_arg_0 & mask_SORT_19 [L240] var_21_arg_0 = var_21_arg_0 & mask_SORT_19 [L241] SORT_13 var_21 = var_21_arg_0; [L242] SORT_13 var_22_arg_0 = var_14; [L243] SORT_13 var_22_arg_1 = var_21; [L244] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L245] SORT_13 var_16_arg_0 = var_14; [L246] SORT_13 var_16_arg_1 = var_15; [L247] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L248] SORT_1 var_17_arg_0 = var_16; [L249] SORT_3 var_17_arg_1 = state_10; [L250] SORT_3 var_17_arg_2 = input_9; [L251] SORT_3 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L252] SORT_1 var_23_arg_0 = var_22; [L253] SORT_3 var_23_arg_1 = state_18; [L254] SORT_3 var_23_arg_2 = var_17; [L255] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L256] SORT_1 var_28_arg_0 = var_27; [L257] SORT_3 var_28_arg_1 = state_24; [L258] SORT_3 var_28_arg_2 = var_23; [L259] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L260] SORT_1 var_33_arg_0 = var_32; [L261] SORT_3 var_33_arg_1 = state_29; [L262] SORT_3 var_33_arg_2 = var_28; [L263] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L264] SORT_1 var_38_arg_0 = var_37; [L265] SORT_3 var_38_arg_1 = state_34; [L266] SORT_3 var_38_arg_2 = var_33; [L267] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L268] SORT_1 var_44_arg_0 = var_43; [L269] SORT_3 var_44_arg_1 = state_39; [L270] SORT_3 var_44_arg_2 = var_38; [L271] SORT_3 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L272] SORT_1 var_49_arg_0 = var_48; [L273] SORT_3 var_49_arg_1 = state_45; [L274] SORT_3 var_49_arg_2 = var_44; [L275] SORT_3 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L276] SORT_1 var_54_arg_0 = var_53; [L277] SORT_3 var_54_arg_1 = state_50; [L278] SORT_3 var_54_arg_2 = var_49; [L279] SORT_3 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L280] SORT_1 var_58_arg_0 = var_57; [L281] SORT_3 var_58_arg_1 = state_55; [L282] SORT_3 var_58_arg_2 = var_54; [L283] SORT_3 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L284] EXPR var_58 & mask_SORT_3 [L284] var_58 = var_58 & mask_SORT_3 [L285] SORT_3 var_88_arg_0 = state_87; [L286] SORT_3 var_88_arg_1 = var_58; [L287] SORT_1 var_88 = var_88_arg_0 == var_88_arg_1; [L288] SORT_1 var_89_arg_0 = var_86; [L289] SORT_1 var_89_arg_1 = var_88; [L290] EXPR var_89_arg_0 | var_89_arg_1 [L290] SORT_1 var_89 = var_89_arg_0 | var_89_arg_1; [L291] SORT_1 var_110_arg_0 = state_91; [L292] SORT_1 var_110_arg_1 = input_109; [L293] SORT_1 var_110_arg_2 = var_89; [L294] SORT_1 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L295] SORT_1 var_113_arg_0 = var_110; [L296] SORT_1 var_113 = ~var_113_arg_0; [L297] SORT_1 var_114_arg_0 = var_112; [L298] SORT_1 var_114_arg_1 = var_113; [L299] EXPR var_114_arg_0 & var_114_arg_1 [L299] SORT_1 var_114 = var_114_arg_0 & var_114_arg_1; [L300] EXPR var_114 & mask_SORT_1 [L300] var_114 = var_114 & mask_SORT_1 [L301] SORT_1 bad_115_arg_0 = var_114; [L302] CALL __VERIFIER_assert(!(bad_115_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 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 12/12 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 20:29:33,253 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...