/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-81.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:03:04,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:03:04,688 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-19 11:03:04,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:03:04,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:03:04,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:03:04,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:03:04,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:03:04,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:03:04,725 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:03:04,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:03:04,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:03:04,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:03:04,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:03:04,727 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:03:04,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:03:04,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:03:04,728 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:03:04,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:03:04,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:03:04,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:03:04,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:03:04,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:03:04,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:03:04,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:03:04,729 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:03:04,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:03:04,729 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:03:04,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:03:04,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:03:04,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:03:04,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:03:04,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:03:04,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:03:04,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:03:04,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:03:04,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:03:04,732 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-19 11:03:04,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:03:04,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:03:04,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:03:04,928 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:03:04,928 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:03:04,929 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-81.i [2023-12-19 11:03:05,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:03:06,195 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:03:06,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2023-12-19 11:03:06,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad288aba1/76b731a61114452e89b4a29f1e714044/FLAG571e0bf3f [2023-12-19 11:03:06,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad288aba1/76b731a61114452e89b4a29f1e714044 [2023-12-19 11:03:06,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:03:06,221 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:03:06,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:03:06,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:03:06,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:03:06,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45999c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06, skipping insertion in model container [2023-12-19 11:03:06,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,250 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:03:06,369 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-81.i[916,929] [2023-12-19 11:03:06,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:03:06,401 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:03:06,409 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-81.i[916,929] [2023-12-19 11:03:06,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:03:06,436 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:03:06,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06 WrapperNode [2023-12-19 11:03:06,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:03:06,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:03:06,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:03:06,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:03:06,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,482 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2023-12-19 11:03:06,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:03:06,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:03:06,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:03:06,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:03:06,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,502 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-19 11:03:06,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:03:06,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:03:06,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:03:06,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:03:06,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (1/1) ... [2023-12-19 11:03:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:03:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:03:06,562 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-19 11:03:06,622 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-19 11:03:06,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:03:06,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:03:06,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:03:06,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:03:06,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:03:06,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:03:06,716 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:03:06,718 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:03:06,994 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:03:07,027 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:03:07,027 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:03:07,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:03:07 BoogieIcfgContainer [2023-12-19 11:03:07,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:03:07,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:03:07,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:03:07,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:03:07,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:03:06" (1/3) ... [2023-12-19 11:03:07,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a47933b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:03:07, skipping insertion in model container [2023-12-19 11:03:07,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:03:06" (2/3) ... [2023-12-19 11:03:07,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a47933b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:03:07, skipping insertion in model container [2023-12-19 11:03:07,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:03:07" (3/3) ... [2023-12-19 11:03:07,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2023-12-19 11:03:07,047 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:03:07,047 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:03:07,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:03:07,134 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;@419df75f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:03:07,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:03:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 11:03:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 11:03:07,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:03:07,152 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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-19 11:03:07,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:03:07,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:03:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -729649733, now seen corresponding path program 1 times [2023-12-19 11:03:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:03:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397682165] [2023-12-19 11:03:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:03:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:03:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:03:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:03:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:03:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:03:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:03:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:03:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:03:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:03:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:03:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:03:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:03:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:03:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:03:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:03:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 11:03:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 11:03:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 11:03:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 11:03:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 11:03:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 11:03:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 11:03:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-19 11:03:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 11:03:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:03:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397682165] [2023-12-19 11:03:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397682165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:03:07,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:03:07,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:03:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852909827] [2023-12-19 11:03:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:03:07,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:03:07,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:03:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:03:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:03:07,515 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-19 11:03:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:03:07,551 INFO L93 Difference]: Finished difference Result 123 states and 220 transitions. [2023-12-19 11:03:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:03:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2023-12-19 11:03:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:03:07,560 INFO L225 Difference]: With dead ends: 123 [2023-12-19 11:03:07,560 INFO L226 Difference]: Without dead ends: 61 [2023-12-19 11:03:07,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-19 11:03:07,576 INFO L413 NwaCegarLoop]: 92 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, 92 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-19 11:03:07,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:03:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-19 11:03:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-19 11:03:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 11:03:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 95 transitions. [2023-12-19 11:03:07,637 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 95 transitions. Word has length 135 [2023-12-19 11:03:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:03:07,637 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 95 transitions. [2023-12-19 11:03:07,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-19 11:03:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 95 transitions. [2023-12-19 11:03:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 11:03:07,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:03:07,640 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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-19 11:03:07,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:03:07,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:03:07,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:03:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2027312005, now seen corresponding path program 1 times [2023-12-19 11:03:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:03:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299158078] [2023-12-19 11:03:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:03:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:03:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:03:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:03:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:03:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:03:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:03:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:03:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:03:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:03:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:03:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:03:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:03:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:03:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:03:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:03:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 11:03:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 11:03:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 11:03:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 11:03:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 11:03:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 11:03:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 11:03:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-19 11:03:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 11:03:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:03:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299158078] [2023-12-19 11:03:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299158078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:03:08,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:03:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:03:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094423090] [2023-12-19 11:03:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:03:08,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:03:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:03:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:03:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:03:08,024 INFO L87 Difference]: Start difference. First operand 61 states and 95 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:03:08,218 INFO L93 Difference]: Finished difference Result 182 states and 284 transitions. [2023-12-19 11:03:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:03:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2023-12-19 11:03:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:03:08,224 INFO L225 Difference]: With dead ends: 182 [2023-12-19 11:03:08,225 INFO L226 Difference]: Without dead ends: 122 [2023-12-19 11:03:08,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-19 11:03:08,228 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:03:08,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 249 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:03:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-19 11:03:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2023-12-19 11:03:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 11:03:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 179 transitions. [2023-12-19 11:03:08,248 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 179 transitions. Word has length 135 [2023-12-19 11:03:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:03:08,248 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 179 transitions. [2023-12-19 11:03:08,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 179 transitions. [2023-12-19 11:03:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-19 11:03:08,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:03:08,250 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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-19 11:03:08,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:03:08,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:03:08,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:03:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -21452946, now seen corresponding path program 1 times [2023-12-19 11:03:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:03:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388137301] [2023-12-19 11:03:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:03:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:03:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:03:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:03:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:03:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:03:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:03:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:03:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:03:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:03:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:03:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:03:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:03:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:03:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:03:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:03:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 11:03:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 11:03:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 11:03:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 11:03:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 11:03:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 11:03:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 11:03:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-19 11:03:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 11:03:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:03:09,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388137301] [2023-12-19 11:03:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388137301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:03:09,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:03:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:03:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841547805] [2023-12-19 11:03:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:03:09,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:03:09,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:03:09,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:03:09,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:03:09,545 INFO L87 Difference]: Start difference. First operand 115 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:03:09,642 INFO L93 Difference]: Finished difference Result 192 states and 296 transitions. [2023-12-19 11:03:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 11:03:09,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2023-12-19 11:03:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:03:09,647 INFO L225 Difference]: With dead ends: 192 [2023-12-19 11:03:09,647 INFO L226 Difference]: Without dead ends: 132 [2023-12-19 11:03:09,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:03:09,653 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:03:09,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 337 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:03:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-19 11:03:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2023-12-19 11:03:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 11:03:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 183 transitions. [2023-12-19 11:03:09,685 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 183 transitions. Word has length 136 [2023-12-19 11:03:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:03:09,686 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 183 transitions. [2023-12-19 11:03:09,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 183 transitions. [2023-12-19 11:03:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-19 11:03:09,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:03:09,688 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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-19 11:03:09,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:03:09,688 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:03:09,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:03:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 35805356, now seen corresponding path program 1 times [2023-12-19 11:03:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:03:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706089492] [2023-12-19 11:03:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:03:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:03:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:03:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:03:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:03:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:03:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:03:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:03:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:03:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:03:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:03:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:03:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:03:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:03:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:03:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:03:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 11:03:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 11:03:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 11:03:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 11:03:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 11:03:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 11:03:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 11:03:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-19 11:03:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 11:03:10,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:03:10,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706089492] [2023-12-19 11:03:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706089492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:03:10,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:03:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:03:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78003865] [2023-12-19 11:03:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:03:10,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:03:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:03:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:03:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:03:10,433 INFO L87 Difference]: Start difference. First operand 119 states and 183 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:03:10,488 INFO L93 Difference]: Finished difference Result 211 states and 322 transitions. [2023-12-19 11:03:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 11:03:10,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2023-12-19 11:03:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:03:10,489 INFO L225 Difference]: With dead ends: 211 [2023-12-19 11:03:10,489 INFO L226 Difference]: Without dead ends: 144 [2023-12-19 11:03:10,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:03:10,494 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 28 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:03:10,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 390 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:03:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-19 11:03:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2023-12-19 11:03:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 11:03:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2023-12-19 11:03:10,520 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 136 [2023-12-19 11:03:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:03:10,520 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2023-12-19 11:03:10,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2023-12-19 11:03:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-19 11:03:10,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:03:10,522 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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-19 11:03:10,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 11:03:10,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:03:10,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:03:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1545176986, now seen corresponding path program 1 times [2023-12-19 11:03:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:03:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640250066] [2023-12-19 11:03:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:03:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:03:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:03:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:03:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:03:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:03:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:03:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:03:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:03:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:03:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:03:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:03:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:03:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:03:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:03:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:03:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 11:03:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 11:03:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 11:03:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 11:03:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 11:03:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 11:03:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 11:03:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-19 11:03:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:03:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 11:03:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:03:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640250066] [2023-12-19 11:03:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640250066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:03:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:03:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:03:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803672110] [2023-12-19 11:03:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:03:10,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:03:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:03:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:03:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:03:10,737 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:03:10,831 INFO L93 Difference]: Finished difference Result 219 states and 333 transitions. [2023-12-19 11:03:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:03:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2023-12-19 11:03:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:03:10,833 INFO L225 Difference]: With dead ends: 219 [2023-12-19 11:03:10,833 INFO L226 Difference]: Without dead ends: 134 [2023-12-19 11:03:10,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-19 11:03:10,834 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:03:10,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 254 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:03:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-19 11:03:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2023-12-19 11:03:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 11:03:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2023-12-19 11:03:10,844 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 139 [2023-12-19 11:03:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:03:10,845 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2023-12-19 11:03:10,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-19 11:03:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2023-12-19 11:03:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-19 11:03:10,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:03:10,847 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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-19 11:03:10,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 11:03:10,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:03:10,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:03:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1383454848, now seen corresponding path program 1 times [2023-12-19 11:03:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:03:10,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964581821] [2023-12-19 11:03:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:03:10,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:03:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:03:10,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 11:03:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:03:11,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 11:03:11,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 11:03:11,041 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:03:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:03:11,048 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-19 11:03:11,051 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:03:11,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:03:11 BoogieIcfgContainer [2023-12-19 11:03:11,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:03:11,136 INFO L158 Benchmark]: Toolchain (without parser) took 4914.88ms. Allocated memory was 318.8MB in the beginning and 423.6MB in the end (delta: 104.9MB). Free memory was 274.3MB in the beginning and 356.3MB in the end (delta: -82.0MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2023-12-19 11:03:11,136 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 227.5MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:03:11,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.41ms. Allocated memory is still 318.8MB. Free memory was 274.0MB in the beginning and 260.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 11:03:11,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.86ms. Allocated memory is still 318.8MB. Free memory was 260.9MB in the beginning and 258.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 11:03:11,136 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 318.8MB. Free memory was 258.0MB in the beginning and 254.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 11:03:11,136 INFO L158 Benchmark]: RCFGBuilder took 512.44ms. Allocated memory is still 318.8MB. Free memory was 254.6MB in the beginning and 233.9MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-19 11:03:11,137 INFO L158 Benchmark]: TraceAbstraction took 4105.52ms. Allocated memory was 318.8MB in the beginning and 423.6MB in the end (delta: 104.9MB). Free memory was 233.1MB in the beginning and 356.3MB in the end (delta: -123.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:03:11,138 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.10ms. Allocated memory is still 227.5MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.41ms. Allocated memory is still 318.8MB. Free memory was 274.0MB in the beginning and 260.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.86ms. Allocated memory is still 318.8MB. Free memory was 260.9MB in the beginning and 258.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 318.8MB. Free memory was 258.0MB in the beginning and 254.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 512.44ms. Allocated memory is still 318.8MB. Free memory was 254.6MB in the beginning and 233.9MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4105.52ms. Allocated memory was 318.8MB in the beginning and 423.6MB in the end (delta: 104.9MB). Free memory was 233.1MB in the beginning and 356.3MB in the end (delta: -123.2MB). There was no memory consumed. 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 bitwiseOr at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 4; [L25] signed long int var_1_4 = 2; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 999999999; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L106] last_1_var_1_13 = var_1_13 [L107] last_1_var_1_18 = var_1_18 [L117] RET updateLastVariables() [L118] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L81] RET assume_abort_if_not(var_1_5 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L83] var_1_6 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L95] var_1_15 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L98] var_1_16 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L102] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L118] RET updateVariables() [L119] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1, stepLocal_2=-63, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1, stepLocal_2=-63, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=9999, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1, stepLocal_2=-63, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=2147483646, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=2147483646, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L110] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=2147483646, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=2147483646, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L110-L111] return (((var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=2147483646, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=32767, var_1_17=0, var_1_18=65534, var_1_1=2147483646, var_1_2=1, var_1_3=2147483646, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 1322 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 857 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 465 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=4, 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, 5 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4620/4620 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-19 11:03:11,161 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...