/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-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i


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


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-15 20:44:32,531 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-15 20:44:32,580 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2023-12-15 20:44:32,583 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-15 20:44:32,583 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-15 20:44:32,600 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-15 20:44:32,601 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-15 20:44:32,601 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-15 20:44:32,601 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-15 20:44:32,602 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-15 20:44:32,602 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-15 20:44:32,602 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-15 20:44:32,603 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-15 20:44:32,603 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-15 20:44:32,603 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-15 20:44:32,603 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-15 20:44:32,604 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-15 20:44:32,604 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-15 20:44:32,604 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-12-15 20:44:32,604 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-15 20:44:32,605 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-15 20:44:32,608 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-15 20:44:32,608 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-15 20:44:32,609 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-15 20:44:32,609 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-15 20:44:32,609 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-15 20:44:32,609 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-15 20:44:32,610 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-15 20:44:32,610 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-15 20:44:32,610 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-15 20:44:32,610 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-15 20:44:32,611 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-15 20:44:32,611 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-15 20:44:32,611 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-15 20:44:32,611 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-15 20:44:32,612 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-15 20:44:32,612 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-12-15 20:44:32,612 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-12-15 20:44:32,612 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-15 20:44:32,613 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-15 20:44:32,613 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-15 20:44:32,617 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-15 20:44:32,618 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-15 20:44:32,618 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-15 20:44:32,782 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-15 20:44:32,801 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-15 20:44:32,803 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-15 20:44:32,803 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-15 20:44:32,804 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-15 20:44:32,804 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i
[2023-12-15 20:44:33,851 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-15 20:44:33,987 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-15 20:44:33,988 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i
[2023-12-15 20:44:33,993 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1300c197/978af545e1f94b7986a8ec0446f9e7ff/FLAGa37e0fafc
[2023-12-15 20:44:34,004 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1300c197/978af545e1f94b7986a8ec0446f9e7ff
[2023-12-15 20:44:34,006 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-15 20:44:34,007 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-15 20:44:34,008 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-15 20:44:34,008 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-15 20:44:34,012 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-15 20:44:34,013 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,013 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1566e04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34, skipping insertion in model container
[2023-12-15 20:44:34,014 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,035 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-15 20:44:34,143 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929]
[2023-12-15 20:44:34,172 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-15 20:44:34,180 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-15 20:44:34,188 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929]
[2023-12-15 20:44:34,209 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-15 20:44:34,220 INFO  L206         MainTranslator]: Completed translation
[2023-12-15 20:44:34,221 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34 WrapperNode
[2023-12-15 20:44:34,221 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-15 20:44:34,222 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-15 20:44:34,222 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-15 20:44:34,222 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-15 20:44:34,228 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,234 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,258 INFO  L138                Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101
[2023-12-15 20:44:34,258 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-15 20:44:34,259 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-15 20:44:34,259 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-15 20:44:34,259 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-15 20:44:34,271 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,271 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,273 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,297 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-15 20:44:34,298 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,298 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,301 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,303 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,304 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,305 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,307 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-15 20:44:34,307 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-15 20:44:34,308 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-15 20:44:34,308 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-15 20:44:34,308 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (1/1) ...
[2023-12-15 20:44:34,312 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-15 20:44:34,322 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-15 20:44:34,340 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-15 20:44:34,342 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-15 20:44:34,365 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-15 20:44:34,365 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-12-15 20:44:34,366 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-12-15 20:44:34,366 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-12-15 20:44:34,366 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-15 20:44:34,366 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-15 20:44:34,419 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-15 20:44:34,421 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-15 20:44:34,559 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-15 20:44:34,595 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-15 20:44:34,595 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-12-15 20:44:34,595 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:44:34 BoogieIcfgContainer
[2023-12-15 20:44:34,595 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-15 20:44:34,597 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-15 20:44:34,597 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-15 20:44:34,599 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-15 20:44:34,599 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:44:34" (1/3) ...
[2023-12-15 20:44:34,600 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59900be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:44:34, skipping insertion in model container
[2023-12-15 20:44:34,600 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:34" (2/3) ...
[2023-12-15 20:44:34,600 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59900be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:44:34, skipping insertion in model container
[2023-12-15 20:44:34,600 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:44:34" (3/3) ...
[2023-12-15 20:44:34,601 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i
[2023-12-15 20:44:34,618 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-15 20:44:34,618 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-15 20:44:34,663 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-15 20:44:34,669 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;@57872c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-15 20:44:34,669 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-15 20:44:34,673 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-15 20:44:34,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2023-12-15 20:44:34,684 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-15 20:44:34,684 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-15 20:44:34,685 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-15 20:44:34,689 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-15 20:44:34,690 INFO  L85        PathProgramCache]: Analyzing trace with hash -1407298392, now seen corresponding path program 1 times
[2023-12-15 20:44:34,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-15 20:44:34,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241754233]
[2023-12-15 20:44:34,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-15 20:44:34,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-15 20:44:34,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,874 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-12-15 20:44:34,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,880 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-12-15 20:44:34,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,884 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-12-15 20:44:34,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,887 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-12-15 20:44:34,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,890 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-12-15 20:44:34,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,901 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2023-12-15 20:44:34,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,905 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-12-15 20:44:34,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,908 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2023-12-15 20:44:34,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,912 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2023-12-15 20:44:34,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,915 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2023-12-15 20:44:34,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,917 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2023-12-15 20:44:34,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,920 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2023-12-15 20:44:34,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,923 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2023-12-15 20:44:34,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,925 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2023-12-15 20:44:34,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:34,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-15 20:44:34,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-15 20:44:34,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241754233]
[2023-12-15 20:44:34,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241754233] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-15 20:44:34,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-15 20:44:34,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-12-15 20:44:34,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151351509]
[2023-12-15 20:44:34,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-15 20:44:34,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-12-15 20:44:34,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-15 20:44:34,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-12-15 20:44:34,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-15 20:44:34,966 INFO  L87              Difference]: Start difference. First operand  has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand  has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-15 20:44:34,989 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-15 20:44:34,989 INFO  L93              Difference]: Finished difference Result 81 states and 140 transitions.
[2023-12-15 20:44:34,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-12-15 20:44:34,990 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88
[2023-12-15 20:44:34,991 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-15 20:44:34,997 INFO  L225             Difference]: With dead ends: 81
[2023-12-15 20:44:34,997 INFO  L226             Difference]: Without dead ends: 40
[2023-12-15 20:44:35,001 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-15 20:44:35,005 INFO  L413           NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-15 20:44:35,007 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-15 20:44:35,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2023-12-15 20:44:35,071 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2023-12-15 20:44:35,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-15 20:44:35,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions.
[2023-12-15 20:44:35,077 INFO  L78                 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88
[2023-12-15 20:44:35,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-15 20:44:35,077 INFO  L495      AbstractCegarLoop]: Abstraction has 40 states and 59 transitions.
[2023-12-15 20:44:35,078 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-15 20:44:35,078 INFO  L276                IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions.
[2023-12-15 20:44:35,082 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2023-12-15 20:44:35,082 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-15 20:44:35,082 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-15 20:44:35,083 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-12-15 20:44:35,083 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-15 20:44:35,084 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-15 20:44:35,084 INFO  L85        PathProgramCache]: Analyzing trace with hash -1413022232, now seen corresponding path program 1 times
[2023-12-15 20:44:35,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-15 20:44:35,084 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695346495]
[2023-12-15 20:44:35,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-15 20:44:35,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-15 20:44:35,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,369 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-12-15 20:44:35,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,373 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-12-15 20:44:35,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,377 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-12-15 20:44:35,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,379 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-12-15 20:44:35,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,382 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-12-15 20:44:35,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,389 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2023-12-15 20:44:35,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,393 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-12-15 20:44:35,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,396 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2023-12-15 20:44:35,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,399 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2023-12-15 20:44:35,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,403 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2023-12-15 20:44:35,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,407 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2023-12-15 20:44:35,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,410 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2023-12-15 20:44:35,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,413 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2023-12-15 20:44:35,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,415 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2023-12-15 20:44:35,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:35,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-15 20:44:35,419 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-15 20:44:35,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695346495]
[2023-12-15 20:44:35,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695346495] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-15 20:44:35,420 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-15 20:44:35,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-15 20:44:35,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001221258]
[2023-12-15 20:44:35,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-15 20:44:35,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-15 20:44:35,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-15 20:44:35,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-15 20:44:35,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-15 20:44:35,422 INFO  L87              Difference]: Start difference. First operand 40 states and 59 transitions. Second operand  has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-15 20:44:35,489 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-15 20:44:35,489 INFO  L93              Difference]: Finished difference Result 118 states and 175 transitions.
[2023-12-15 20:44:35,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-15 20:44:35,493 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88
[2023-12-15 20:44:35,493 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-15 20:44:35,495 INFO  L225             Difference]: With dead ends: 118
[2023-12-15 20:44:35,495 INFO  L226             Difference]: Without dead ends: 79
[2023-12-15 20:44:35,495 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-15 20:44:35,496 INFO  L413           NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-15 20:44:35,496 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 155 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-15 20:44:35,497 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2023-12-15 20:44:35,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76.
[2023-12-15 20:44:35,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2023-12-15 20:44:35,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions.
[2023-12-15 20:44:35,517 INFO  L78                 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 88
[2023-12-15 20:44:35,518 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-15 20:44:35,518 INFO  L495      AbstractCegarLoop]: Abstraction has 76 states and 112 transitions.
[2023-12-15 20:44:35,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-15 20:44:35,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions.
[2023-12-15 20:44:35,519 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2023-12-15 20:44:35,519 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-15 20:44:35,519 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-15 20:44:35,519 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-12-15 20:44:35,519 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-15 20:44:35,520 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-15 20:44:35,520 INFO  L85        PathProgramCache]: Analyzing trace with hash -1412962650, now seen corresponding path program 1 times
[2023-12-15 20:44:35,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-15 20:44:35,520 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400100057]
[2023-12-15 20:44:35,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-15 20:44:35,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-15 20:44:35,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,665 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-12-15 20:44:36,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,671 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-12-15 20:44:36,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,677 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-12-15 20:44:36,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,680 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-12-15 20:44:36,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,696 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-12-15 20:44:36,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,703 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2023-12-15 20:44:36,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,713 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-12-15 20:44:36,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,726 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2023-12-15 20:44:36,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,733 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2023-12-15 20:44:36,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,754 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2023-12-15 20:44:36,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,766 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2023-12-15 20:44:36,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,775 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2023-12-15 20:44:36,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,791 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2023-12-15 20:44:36,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,800 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2023-12-15 20:44:36,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-15 20:44:36,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-15 20:44:36,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-15 20:44:36,815 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400100057]
[2023-12-15 20:44:36,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400100057] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-15 20:44:36,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-15 20:44:36,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2023-12-15 20:44:36,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250199358]
[2023-12-15 20:44:36,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-15 20:44:36,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-12-15 20:44:36,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-15 20:44:36,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-12-15 20:44:36,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-12-15 20:44:36,821 INFO  L87              Difference]: Start difference. First operand 76 states and 112 transitions. Second operand  has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-15 20:44:37,444 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-15 20:44:37,444 INFO  L93              Difference]: Finished difference Result 145 states and 197 transitions.
[2023-12-15 20:44:37,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-12-15 20:44:37,444 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88
[2023-12-15 20:44:37,445 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-15 20:44:37,446 INFO  L225             Difference]: With dead ends: 145
[2023-12-15 20:44:37,446 INFO  L226             Difference]: Without dead ends: 143
[2023-12-15 20:44:37,446 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462
[2023-12-15 20:44:37,447 INFO  L413           NwaCegarLoop]: 78 mSDtfsCounter, 124 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-12-15 20:44:37,447 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 322 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-12-15 20:44:37,448 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2023-12-15 20:44:37,493 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119.
[2023-12-15 20:44:37,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42)
[2023-12-15 20:44:37,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions.
[2023-12-15 20:44:37,497 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 88
[2023-12-15 20:44:37,498 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-15 20:44:37,499 INFO  L495      AbstractCegarLoop]: Abstraction has 119 states and 170 transitions.
[2023-12-15 20:44:37,499 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-15 20:44:37,499 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions.
[2023-12-15 20:44:37,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2023-12-15 20:44:37,503 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-15 20:44:37,503 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-15 20:44:37,503 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-12-15 20:44:37,503 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-15 20:44:37,504 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-15 20:44:37,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -732904280, now seen corresponding path program 1 times
[2023-12-15 20:44:37,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-15 20:44:37,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35234071]
[2023-12-15 20:44:37,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-15 20:44:37,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-15 20:44:37,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-15 20:44:37,530 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-15 20:44:37,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-15 20:44:37,568 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-12-15 20:44:37,568 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-15 20:44:37,569 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-15 20:44:37,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-12-15 20:44:37,572 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-12-15 20:44:37,574 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-15 20:44:37,608 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:44:37 BoogieIcfgContainer
[2023-12-15 20:44:37,609 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-15 20:44:37,609 INFO  L158              Benchmark]: Toolchain (without parser) took 3601.72ms. Allocated memory was 200.3MB in the beginning and 248.5MB in the end (delta: 48.2MB). Free memory was 153.0MB in the beginning and 125.4MB in the end (delta: 27.5MB). Peak memory consumption was 76.7MB. Max. memory is 8.0GB.
[2023-12-15 20:44:37,609 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-12-15 20:44:37,609 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 212.81ms. Allocated memory is still 200.3MB. Free memory was 153.0MB in the beginning and 140.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2023-12-15 20:44:37,610 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.00ms. Allocated memory is still 200.3MB. Free memory was 140.8MB in the beginning and 138.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-12-15 20:44:37,610 INFO  L158              Benchmark]: Boogie Preprocessor took 47.79ms. Allocated memory is still 200.3MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-15 20:44:37,610 INFO  L158              Benchmark]: RCFGBuilder took 287.93ms. Allocated memory is still 200.3MB. Free memory was 135.7MB in the beginning and 119.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB.
[2023-12-15 20:44:37,610 INFO  L158              Benchmark]: TraceAbstraction took 3011.61ms. Allocated memory was 200.3MB in the beginning and 248.5MB in the end (delta: 48.2MB). Free memory was 118.9MB in the beginning and 125.4MB in the end (delta: -6.5MB). Peak memory consumption was 43.2MB. Max. memory is 8.0GB.
[2023-12-15 20:44:37,612 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 200.3MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 212.81ms. Allocated memory is still 200.3MB. Free memory was 153.0MB in the beginning and 140.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 37.00ms. Allocated memory is still 200.3MB. Free memory was 140.8MB in the beginning and 138.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 47.79ms. Allocated memory is still 200.3MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 287.93ms. Allocated memory is still 200.3MB. Free memory was 135.7MB in the beginning and 119.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB.
 * TraceAbstraction took 3011.61ms. Allocated memory was 200.3MB in the beginning and 248.5MB in the end (delta: 48.2MB). Free memory was 118.9MB in the beginning and 125.4MB in the end (delta: -6.5MB). Peak memory consumption was 43.2MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: 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 to_int at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90. 
Possible FailurePath: 
[L21]                  unsigned char isInitial = 0;
[L22]                  signed long int var_1_1 = -200;
[L23]                  unsigned char var_1_2 = 0;
[L24]                  unsigned char var_1_3 = 1;
[L25]                  signed long int var_1_9 = 100;
[L26]                  signed long int var_1_10 = 4;
[L27]                  signed long int var_1_11 = 128;
[L28]                  signed long int var_1_12 = 128;
[L29]                  signed long int var_1_13 = 0;
[L30]                  signed long int var_1_14 = 127;
[L31]                  unsigned char var_1_15 = 1;
[L32]                  unsigned char var_1_16 = 16;
[L94]                  isInitial = 1
[L95]      FCALL       initially()
[L96]      COND TRUE   1
[L97]      FCALL       updateLastVariables()
[L98]      CALL        updateVariables()
[L65]                  var_1_2 = __VERIFIER_nondet_uchar()
[L66]      CALL        assume_abort_if_not(var_1_2 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100]
[L66]      RET         assume_abort_if_not(var_1_2 >= 0)
           VAL         [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100]
[L67]      CALL        assume_abort_if_not(var_1_2 <= 1)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100]
[L67]      RET         assume_abort_if_not(var_1_2 <= 1)
           VAL         [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100]
[L68]                  var_1_3 = __VERIFIER_nondet_uchar()
[L69]      CALL        assume_abort_if_not(var_1_3 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100]
[L69]      RET         assume_abort_if_not(var_1_3 >= 0)
           VAL         [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100]
[L70]      CALL        assume_abort_if_not(var_1_3 <= 1)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L70]      RET         assume_abort_if_not(var_1_3 <= 1)
           VAL         [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L71]                  var_1_10 = __VERIFIER_nondet_long()
[L72]      CALL        assume_abort_if_not(var_1_10 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L72]      RET         assume_abort_if_not(var_1_10 >= 0)
           VAL         [isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L73]      CALL        assume_abort_if_not(var_1_10 <= 2147483647)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L73]      RET         assume_abort_if_not(var_1_10 <= 2147483647)
           VAL         [isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L74]                  var_1_11 = __VERIFIER_nondet_long()
[L75]      CALL        assume_abort_if_not(var_1_11 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L75]      RET         assume_abort_if_not(var_1_11 >= 0)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L76]      CALL        assume_abort_if_not(var_1_11 <= 2147483647)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L76]      RET         assume_abort_if_not(var_1_11 <= 2147483647)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L77]                  var_1_13 = __VERIFIER_nondet_long()
[L78]      CALL        assume_abort_if_not(var_1_13 >= 2147483647)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L78]      RET         assume_abort_if_not(var_1_13 >= 2147483647)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L79]      CALL        assume_abort_if_not(var_1_13 <= 2147483647)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L79]      RET         assume_abort_if_not(var_1_13 <= 2147483647)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L80]                  var_1_14 = __VERIFIER_nondet_long()
[L81]      CALL        assume_abort_if_not(var_1_14 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L81]      RET         assume_abort_if_not(var_1_14 >= 0)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L82]      CALL        assume_abort_if_not(var_1_14 <= 2147483647)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L82]      RET         assume_abort_if_not(var_1_14 <= 2147483647)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L83]                  var_1_16 = __VERIFIER_nondet_uchar()
[L84]      CALL        assume_abort_if_not(var_1_16 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L84]      RET         assume_abort_if_not(var_1_16 >= 0)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L85]      CALL        assume_abort_if_not(var_1_16 <= 254)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L85]      RET         assume_abort_if_not(var_1_16 <= 254)
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L98]      RET         updateVariables()
[L99]      CALL        step()
[L36]      COND FALSE  !(0.8f > (- var_1_10))
           VAL         [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L39]                  unsigned char stepLocal_1 = var_1_15 > var_1_15;
[L40]                  unsigned char stepLocal_0 = var_1_3;
           VAL         [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L41]      COND FALSE  !(var_1_2 && stepLocal_0)
           VAL         [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100]
[L48]      COND TRUE   \read(var_1_2)
[L49]                  var_1_9 = (var_1_10 - var_1_11)
           VAL         [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=0]
[L57]                  signed long int stepLocal_2 = var_1_1;
           VAL         [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=-200, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=0]
[L58]      COND FALSE  !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u))))
[L61]                  var_1_12 = ((var_1_13 - var_1_14) - var_1_11)
           VAL         [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=-200, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=0]
[L99]      RET         step()
[L100]     CALL, EXPR  property()
[L90-L91]              return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((signed long int) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((signed long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((signed long int) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((signed long int) (var_1_10 - 99.5))) : (var_1_12 == ((signed long int) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1)
;
[L100]     RET, EXPR   property()
[L100]     CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=0]
[L19]                  reach_error()
           VAL         [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=2147483647, var_1_14=2147483646, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 533 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 187 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 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-15 20:44:37,625 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...