/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.vis_arrays_vsaR_p04.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-16 20:02:23,826 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-16 20:02:23,906 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:02:23,912 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-16 20:02:23,912 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-16 20:02:23,946 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-16 20:02:23,947 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-16 20:02:23,947 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-16 20:02:23,948 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-16 20:02:23,951 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-16 20:02:23,952 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-16 20:02:23,952 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-16 20:02:23,953 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-16 20:02:23,954 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-16 20:02:23,954 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-16 20:02:23,955 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-16 20:02:23,955 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-16 20:02:23,955 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-12-16 20:02:23,956 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-16 20:02:23,956 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-16 20:02:23,956 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-16 20:02:23,956 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-16 20:02:23,957 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-16 20:02:23,957 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-16 20:02:23,957 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-16 20:02:23,958 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-16 20:02:23,958 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-16 20:02:23,958 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-16 20:02:23,958 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-16 20:02:23,959 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 20:02:23,959 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-16 20:02:23,960 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-16 20:02:23,960 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-16 20:02:23,960 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-12-16 20:02:23,960 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-12-16 20:02:23,960 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-16 20:02:23,960 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-16 20:02:23,961 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-16 20:02:23,961 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-16 20:02:23,961 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-16 20:02:23,961 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 20:02:24,203 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-16 20:02:24,227 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-16 20:02:24,229 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-16 20:02:24,231 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-16 20:02:24,231 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-16 20:02:24,232 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c
[2023-12-16 20:02:25,385 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-16 20:02:25,587 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-16 20:02:25,588 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c
[2023-12-16 20:02:25,596 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cd3738e/c87468d3cae14b6aa2bad0f819ddad73/FLAGeaf94a55c
[2023-12-16 20:02:25,614 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cd3738e/c87468d3cae14b6aa2bad0f819ddad73
[2023-12-16 20:02:25,617 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-16 20:02:25,619 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-16 20:02:25,622 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-16 20:02:25,622 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-16 20:02:25,627 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-16 20:02:25,627 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:25,629 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db50e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25, skipping insertion in model container
[2023-12-16 20:02:25,629 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:25,663 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-16 20:02:25,833 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.vis_arrays_vsaR_p04.c[1259,1272]
[2023-12-16 20:02:25,893 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 20:02:25,901 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-16 20:02:25,920 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.vis_arrays_vsaR_p04.c[1259,1272]
[2023-12-16 20:02:25,942 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 20:02:25,958 INFO  L206         MainTranslator]: Completed translation
[2023-12-16 20:02:25,960 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25 WrapperNode
[2023-12-16 20:02:25,960 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-16 20:02:25,961 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-16 20:02:25,965 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-16 20:02:25,965 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-16 20:02:25,972 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:02:25" (1/1) ...
[2023-12-16 20:02:25,981 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:02:25" (1/1) ...
[2023-12-16 20:02:26,021 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208
[2023-12-16 20:02:26,022 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-16 20:02:26,022 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-16 20:02:26,023 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-16 20:02:26,023 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-16 20:02:26,032 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,033 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,037 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,057 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:02:26,057 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,057 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,066 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,070 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,073 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,075 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,083 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-16 20:02:26,084 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-16 20:02:26,084 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-16 20:02:26,084 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-16 20:02:26,085 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (1/1) ...
[2023-12-16 20:02:26,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 20:02:26,112 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 20:02:26,130 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:02:26,156 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:02:26,171 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-16 20:02:26,171 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-12-16 20:02:26,171 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-16 20:02:26,171 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-16 20:02:26,269 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-16 20:02:26,272 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-16 20:02:26,610 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-16 20:02:26,637 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-16 20:02:26,637 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-12-16 20:02:26,638 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:02:26 BoogieIcfgContainer
[2023-12-16 20:02:26,638 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-16 20:02:26,640 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-16 20:02:26,640 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-16 20:02:26,643 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-16 20:02:26,644 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:02:25" (1/3) ...
[2023-12-16 20:02:26,644 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:02:26, skipping insertion in model container
[2023-12-16 20:02:26,644 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:02:25" (2/3) ...
[2023-12-16 20:02:26,645 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:02:26, skipping insertion in model container
[2023-12-16 20:02:26,645 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:02:26" (3/3) ...
[2023-12-16 20:02:26,653 INFO  L112   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c
[2023-12-16 20:02:26,670 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-16 20:02:26,670 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-16 20:02:26,721 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-16 20:02:26,726 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;@6e5005c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-16 20:02:26,727 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-16 20:02:26,730 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:26,737 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2023-12-16 20:02:26,737 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 20:02:26,738 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 20:02:26,738 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 20:02:26,743 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 20:02:26,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 64413162, now seen corresponding path program 1 times
[2023-12-16 20:02:26,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 20:02:26,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861315940]
[2023-12-16 20:02:26,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 20:02:26,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 20:02:26,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 20:02:27,277 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 20:02:27,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 20:02:27,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861315940]
[2023-12-16 20:02:27,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861315940] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 20:02:27,279 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 20:02:27,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-16 20:02:27,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801109242]
[2023-12-16 20:02:27,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 20:02:27,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-16 20:02:27,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 20:02:27,307 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-16 20:02:27,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-16 20:02:27,310 INFO  L87              Difference]: Start difference. First operand  has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:27,345 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 20:02:27,345 INFO  L93              Difference]: Finished difference Result 54 states and 86 transitions.
[2023-12-16 20:02:27,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-16 20:02:27,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2023-12-16 20:02:27,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 20:02:27,355 INFO  L225             Difference]: With dead ends: 54
[2023-12-16 20:02:27,355 INFO  L226             Difference]: Without dead ends: 29
[2023-12-16 20:02:27,359 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 20:02:27,365 INFO  L413           NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 20:02:27,366 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 20:02:27,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2023-12-16 20:02:27,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2023-12-16 20:02:27,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:27,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions.
[2023-12-16 20:02:27,399 INFO  L78                 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16
[2023-12-16 20:02:27,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 20:02:27,399 INFO  L495      AbstractCegarLoop]: Abstraction has 29 states and 43 transitions.
[2023-12-16 20:02:27,399 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:27,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions.
[2023-12-16 20:02:27,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2023-12-16 20:02:27,400 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 20:02:27,400 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 20:02:27,401 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-12-16 20:02:27,401 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 20:02:27,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 20:02:27,402 INFO  L85        PathProgramCache]: Analyzing trace with hash 1998592624, now seen corresponding path program 1 times
[2023-12-16 20:02:27,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 20:02:27,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52347623]
[2023-12-16 20:02:27,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 20:02:27,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 20:02:27,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 20:02:27,583 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 20:02:27,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 20:02:27,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52347623]
[2023-12-16 20:02:27,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52347623] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 20:02:27,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 20:02:27,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-16 20:02:27,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111626850]
[2023-12-16 20:02:27,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 20:02:27,587 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-16 20:02:27,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 20:02:27,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-16 20:02:27,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-16 20:02:27,591 INFO  L87              Difference]: Start difference. First operand 29 states and 43 transitions. Second operand  has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:27,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 20:02:27,631 INFO  L93              Difference]: Finished difference Result 57 states and 84 transitions.
[2023-12-16 20:02:27,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-16 20:02:27,632 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2023-12-16 20:02:27,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 20:02:27,634 INFO  L225             Difference]: With dead ends: 57
[2023-12-16 20:02:27,634 INFO  L226             Difference]: Without dead ends: 32
[2023-12-16 20:02:27,635 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 20:02:27,636 INFO  L413           NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 20:02:27,636 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 20:02:27,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2023-12-16 20:02:27,642 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31.
[2023-12-16 20:02:27,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:27,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions.
[2023-12-16 20:02:27,646 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 17
[2023-12-16 20:02:27,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 20:02:27,647 INFO  L495      AbstractCegarLoop]: Abstraction has 31 states and 45 transitions.
[2023-12-16 20:02:27,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:27,647 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions.
[2023-12-16 20:02:27,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2023-12-16 20:02:27,648 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 20:02:27,649 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 20:02:27,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-12-16 20:02:27,649 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 20:02:27,651 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 20:02:27,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614609346, now seen corresponding path program 1 times
[2023-12-16 20:02:27,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 20:02:27,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417030114]
[2023-12-16 20:02:27,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 20:02:27,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 20:02:27,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 20:02:27,908 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 20:02:27,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 20:02:27,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417030114]
[2023-12-16 20:02:27,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417030114] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 20:02:27,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 20:02:27,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-16 20:02:27,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601153642]
[2023-12-16 20:02:27,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 20:02:27,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-12-16 20:02:27,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 20:02:27,911 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-12-16 20:02:27,911 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-12-16 20:02:27,912 INFO  L87              Difference]: Start difference. First operand 31 states and 45 transitions. Second operand  has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:28,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 20:02:28,026 INFO  L93              Difference]: Finished difference Result 92 states and 134 transitions.
[2023-12-16 20:02:28,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-16 20:02:28,027 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2023-12-16 20:02:28,027 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 20:02:28,029 INFO  L225             Difference]: With dead ends: 92
[2023-12-16 20:02:28,029 INFO  L226             Difference]: Without dead ends: 65
[2023-12-16 20:02:28,031 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2023-12-16 20:02:28,034 INFO  L413           NwaCegarLoop]: 44 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 20:02:28,035 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 20:02:28,037 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2023-12-16 20:02:28,044 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34.
[2023-12-16 20:02:28,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 20:02:28,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions.
[2023-12-16 20:02:28,046 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 18
[2023-12-16 20:02:28,046 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 20:02:28,046 INFO  L495      AbstractCegarLoop]: Abstraction has 34 states and 48 transitions.
[2023-12-16 20:02:28,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:28,048 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions.
[2023-12-16 20:02:28,051 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2023-12-16 20:02:28,051 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 20:02:28,055 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 20:02:28,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-12-16 20:02:28,056 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 20:02:28,056 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 20:02:28,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -905350588, now seen corresponding path program 1 times
[2023-12-16 20:02:28,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 20:02:28,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464150695]
[2023-12-16 20:02:28,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 20:02:28,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 20:02:28,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 20:02:28,425 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 20:02:28,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 20:02:28,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464150695]
[2023-12-16 20:02:28,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464150695] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 20:02:28,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 20:02:28,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-12-16 20:02:28,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552714470]
[2023-12-16 20:02:28,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 20:02:28,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-12-16 20:02:28,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 20:02:28,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-12-16 20:02:28,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-12-16 20:02:28,429 INFO  L87              Difference]: Start difference. First operand 34 states and 48 transitions. Second operand  has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:28,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 20:02:28,546 INFO  L93              Difference]: Finished difference Result 75 states and 107 transitions.
[2023-12-16 20:02:28,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-16 20:02:28,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2023-12-16 20:02:28,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 20:02:28,552 INFO  L225             Difference]: With dead ends: 75
[2023-12-16 20:02:28,553 INFO  L226             Difference]: Without dead ends: 45
[2023-12-16 20:02:28,553 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2023-12-16 20:02:28,554 INFO  L413           NwaCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-16 20:02:28,555 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 128 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-16 20:02:28,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2023-12-16 20:02:28,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34.
[2023-12-16 20:02:28,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 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 20:02:28,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions.
[2023-12-16 20:02:28,562 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 18
[2023-12-16 20:02:28,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 20:02:28,562 INFO  L495      AbstractCegarLoop]: Abstraction has 34 states and 47 transitions.
[2023-12-16 20:02:28,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-16 20:02:28,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions.
[2023-12-16 20:02:28,564 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2023-12-16 20:02:28,564 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 20:02:28,564 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 20:02:28,564 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-12-16 20:02:28,564 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 20:02:28,565 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 20:02:28,565 INFO  L85        PathProgramCache]: Analyzing trace with hash -905410170, now seen corresponding path program 1 times
[2023-12-16 20:02:28,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 20:02:28,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937627577]
[2023-12-16 20:02:28,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 20:02:28,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 20:02:28,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-16 20:02:28,597 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-16 20:02:28,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-16 20:02:28,639 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-12-16 20:02:28,639 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-16 20:02:28,640 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-16 20:02:28,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-12-16 20:02:28,646 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-12-16 20:02:28,649 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-16 20:02:28,692 WARN  L320   BoogieBacktranslator]: Removing null node from list of ATEs: ATE  program state null
[2023-12-16 20:02:28,706 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:02:28 BoogieIcfgContainer
[2023-12-16 20:02:28,707 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-16 20:02:28,707 INFO  L158              Benchmark]: Toolchain (without parser) took 3088.54ms. Allocated memory was 195.0MB in the beginning and 262.1MB in the end (delta: 67.1MB). Free memory was 141.1MB in the beginning and 111.6MB in the end (delta: 29.5MB). Peak memory consumption was 97.7MB. Max. memory is 8.0GB.
[2023-12-16 20:02:28,708 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-12-16 20:02:28,708 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 338.13ms. Allocated memory is still 195.0MB. Free memory was 140.8MB in the beginning and 127.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2023-12-16 20:02:28,708 INFO  L158              Benchmark]: Boogie Procedure Inliner took 60.45ms. Allocated memory is still 195.0MB. Free memory was 127.8MB in the beginning and 123.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
[2023-12-16 20:02:28,710 INFO  L158              Benchmark]: Boogie Preprocessor took 60.61ms. Allocated memory is still 195.0MB. Free memory was 123.7MB in the beginning and 120.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-12-16 20:02:28,710 INFO  L158              Benchmark]: RCFGBuilder took 554.23ms. Allocated memory is still 195.0MB. Free memory was 120.5MB in the beginning and 153.9MB in the end (delta: -33.4MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB.
[2023-12-16 20:02:28,711 INFO  L158              Benchmark]: TraceAbstraction took 2067.20ms. Allocated memory was 195.0MB in the beginning and 262.1MB in the end (delta: 67.1MB). Free memory was 153.4MB in the beginning and 111.6MB in the end (delta: 41.8MB). Peak memory consumption was 110.0MB. Max. memory is 8.0GB.
[2023-12-16 20:02:28,712 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.13ms. Allocated memory is still 195.0MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 338.13ms. Allocated memory is still 195.0MB. Free memory was 140.8MB in the beginning and 127.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 60.45ms. Allocated memory is still 195.0MB. Free memory was 127.8MB in the beginning and 123.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 60.61ms. Allocated memory is still 195.0MB. Free memory was 123.7MB in the beginning and 120.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 554.23ms. Allocated memory is still 195.0MB. Free memory was 120.5MB in the beginning and 153.9MB in the end (delta: -33.4MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB.
 * TraceAbstraction took 2067.20ms. Allocated memory was 195.0MB in the beginning and 262.1MB in the end (delta: 67.1MB). Free memory was 153.4MB in the beginning and 111.6MB in the end (delta: 41.8MB). Peak memory consumption was 110.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 bitwiseAnd at line 106. 
Possible FailurePath: 
[L26]              const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1);
[L27]              const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1);
[L29]              const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5);
[L30]              const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1);
[L32]              const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12);
[L33]              const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1);
[L35]              const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3);
[L36]              const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1);
[L38]              const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 2);
[L39]              const SORT_14 msb_SORT_14 = (SORT_14)1 << (2 - 1);
[L41]              const SORT_7 var_8 = 0;
[L42]              const SORT_1 var_12 = 0;
[L43]              const SORT_14 var_16 = 0;
[L44]              const SORT_1 var_21 = 1;
[L45]              const SORT_7 var_50 = 1;
[L46]              const SORT_7 var_52 = 4;
[L48]              SORT_1 input_2;
[L49]              SORT_3 input_4;
[L50]              SORT_5 input_6;
[L51]              SORT_3 input_25;
[L52]              SORT_3 input_27;
[L53]              SORT_3 input_29;
[L54]              SORT_1 input_31;
[L55]              SORT_5 input_33;
[L56]              SORT_3 input_35;
[L57]              SORT_3 input_37;
[L58]              SORT_3 input_39;
[L59]              SORT_3 input_41;
[L60]              SORT_3 input_43;
[L61]              SORT_3 input_45;
[L62]              SORT_3 input_47;
[L64]   EXPR       __VERIFIER_nondet_uchar() & mask_SORT_7
        VAL        [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0]
[L64]              SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7;
[L66]              SORT_7 init_10_arg_1 = var_8;
[L67]              state_9 = init_10_arg_1
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0]
[L70]              input_2 = __VERIFIER_nondet_uchar()
[L71]              input_4 = __VERIFIER_nondet_uchar()
[L72]              input_6 = __VERIFIER_nondet_ushort()
[L73]              input_25 = __VERIFIER_nondet_uchar()
[L74]              input_27 = __VERIFIER_nondet_uchar()
[L75]              input_29 = __VERIFIER_nondet_uchar()
[L76]              input_31 = __VERIFIER_nondet_uchar()
[L77]              input_33 = __VERIFIER_nondet_ushort()
[L78]              input_35 = __VERIFIER_nondet_uchar()
[L79]              input_37 = __VERIFIER_nondet_uchar()
[L80]              input_39 = __VERIFIER_nondet_uchar()
[L81]              input_41 = __VERIFIER_nondet_uchar()
[L82]              input_43 = __VERIFIER_nondet_uchar()
[L83]              input_45 = __VERIFIER_nondet_uchar()
[L84]              input_47 = __VERIFIER_nondet_uchar()
[L87]              SORT_7 var_11_arg_0 = state_9;
[L88]              SORT_1 var_11 = var_11_arg_0 >> 2;
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0]
[L89]   EXPR       var_11 & mask_SORT_1
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0]
[L89]              var_11 = var_11 & mask_SORT_1
[L90]              SORT_1 var_13_arg_0 = var_11;
[L91]              SORT_1 var_13_arg_1 = var_12;
[L92]              SORT_1 var_13 = var_13_arg_0 == var_13_arg_1;
[L93]              SORT_7 var_15_arg_0 = state_9;
[L94]              SORT_14 var_15 = var_15_arg_0 >> 0;
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0]
[L95]   EXPR       var_15 & mask_SORT_14
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0]
[L95]              var_15 = var_15 & mask_SORT_14
[L96]              SORT_14 var_17_arg_0 = var_15;
[L97]              SORT_14 var_17_arg_1 = var_16;
[L98]              SORT_1 var_17 = var_17_arg_0 == var_17_arg_1;
[L99]              SORT_1 var_18_arg_0 = var_13;
[L100]             SORT_1 var_18_arg_1 = var_17;
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_17=1, var_17_arg_0=0, var_17_arg_1=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_50=1, var_52=4, var_8=0]
[L101]  EXPR       var_18_arg_0 | var_18_arg_1
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_17=1, var_17_arg_0=0, var_17_arg_1=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_50=1, var_52=4, var_8=0]
[L101]             SORT_1 var_18 = var_18_arg_0 | var_18_arg_1;
[L102]             SORT_1 var_22_arg_0 = var_18;
[L103]             SORT_1 var_22 = ~var_22_arg_0;
[L104]             SORT_1 var_23_arg_0 = var_21;
[L105]             SORT_1 var_23_arg_1 = var_22;
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_17=1, var_17_arg_0=0, var_17_arg_1=0, var_18=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_22=254, var_22_arg_0=1, var_23_arg_0=1, var_23_arg_1=254, var_50=1, var_52=4, var_8=0]
[L106]  EXPR       var_23_arg_0 & var_23_arg_1
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_17=1, var_17_arg_0=0, var_17_arg_1=0, var_18=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_22=254, var_22_arg_0=1, var_23_arg_0=1, var_23_arg_1=254, var_50=1, var_52=4, var_8=0]
[L106]             SORT_1 var_23 = var_23_arg_0 & var_23_arg_1;
[L107]  EXPR       var_23 & mask_SORT_1
        VAL        [init_10_arg_1=0, mask_SORT_14=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, msb_SORT_14=2, msb_SORT_1=1, msb_SORT_3=16, msb_SORT_5=2048, msb_SORT_7=4, state_9=0, var_11=0, var_11_arg_0=0, var_12=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_15_arg_0=0, var_16=0, var_17=1, var_17_arg_0=0, var_17_arg_1=0, var_18=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_22=254, var_22_arg_0=1, var_23=1, var_23_arg_0=1, var_23_arg_1=254, var_50=1, var_52=4, var_8=0]
[L107]             var_23 = var_23 & mask_SORT_1
[L108]             SORT_1 bad_24_arg_0 = var_23;
[L109]  CALL       __VERIFIER_assert(!(bad_24_arg_0))
[L21]   COND TRUE  !(cond)
        VAL        [\old(cond)=0, cond=0]
[L21]              reach_error()
        VAL        [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 489 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 158 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, InterpolantAutomatonStates: 22, 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, 43 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 255 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 20:02:28,739 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...