/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:20:17,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:20:18,025 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-21 02:20:18,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:20:18,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:20:18,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:20:18,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:20:18,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:20:18,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:20:18,045 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:20:18,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:20:18,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:20:18,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:20:18,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:20:18,046 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:20:18,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:20:18,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:20:18,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:20:18,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:20:18,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:20:18,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:20:18,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:20:18,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:20:18,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:20:18,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:20:18,052 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:20:18,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:20:18,053 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:20:18,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:20:18,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:20:18,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:20:18,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:20:18,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:20:18,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:20:18,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:20:18,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:20:18,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:20:18,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:20:18,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:20:18,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:20:18,056 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:20:18,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:20:18,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:20:18,056 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:20:18,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:20:18,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:20:18,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:20:18,265 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:20:18,266 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:20:18,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2023-12-21 02:20:19,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:20:19,465 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:20:19,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2023-12-21 02:20:19,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d075110a1/9ad0107407dd4dfeb5d5c4d205308999/FLAGfe46d0670 [2023-12-21 02:20:19,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d075110a1/9ad0107407dd4dfeb5d5c4d205308999 [2023-12-21 02:20:19,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:20:19,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:20:19,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:20:19,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:20:19,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:20:19,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe4df03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19, skipping insertion in model container [2023-12-21 02:20:19,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,511 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:20:19,622 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_variablewrapping_wrapper-s_file-0.i[915,928] [2023-12-21 02:20:19,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:20:19,656 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:20:19,665 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_variablewrapping_wrapper-s_file-0.i[915,928] [2023-12-21 02:20:19,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:20:19,702 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:20:19,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19 WrapperNode [2023-12-21 02:20:19,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:20:19,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:20:19,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:20:19,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:20:19,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,747 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 359 [2023-12-21 02:20:19,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:20:19,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:20:19,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:20:19,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:20:19,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,782 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2023-12-21 02:20:19,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:20:19,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:20:19,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:20:19,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:20:19,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (1/1) ... [2023-12-21 02:20:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:20:19,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:20:19,846 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-21 02:20:19,856 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-21 02:20:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:20:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:20:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:20:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:20:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:20:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:20:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:20:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:20:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:20:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:20:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:20:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:20:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:20:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:20:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:20:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:20:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:20:19,955 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:20:19,957 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:20:20,233 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:20:20,262 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:20:20,262 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:20:20,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:20:20 BoogieIcfgContainer [2023-12-21 02:20:20,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:20:20,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:20:20,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:20:20,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:20:20,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:20:19" (1/3) ... [2023-12-21 02:20:20,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fce260e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:20:20, skipping insertion in model container [2023-12-21 02:20:20,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:19" (2/3) ... [2023-12-21 02:20:20,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fce260e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:20:20, skipping insertion in model container [2023-12-21 02:20:20,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:20:20" (3/3) ... [2023-12-21 02:20:20,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-0.i [2023-12-21 02:20:20,280 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:20:20,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:20:20,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:20:20,338 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;@47c3551f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:20:20,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:20:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:20:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-21 02:20:20,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:20:20,352 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:20:20,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:20:20,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:20:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1941354024, now seen corresponding path program 1 times [2023-12-21 02:20:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:20:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057942024] [2023-12-21 02:20:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:20:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:20:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:20:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:20:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:20:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:20:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:20:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:20:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:20:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:20:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:20:20,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:20:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057942024] [2023-12-21 02:20:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057942024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:20:20,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:20:20,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:20:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002252810] [2023-12-21 02:20:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:20:20,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:20:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:20:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:20:20,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:20:20,698 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:20:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:20:20,762 INFO L93 Difference]: Finished difference Result 150 states and 235 transitions. [2023-12-21 02:20:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:20:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-12-21 02:20:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:20:20,785 INFO L225 Difference]: With dead ends: 150 [2023-12-21 02:20:20,786 INFO L226 Difference]: Without dead ends: 73 [2023-12-21 02:20:20,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-21 02:20:20,791 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:20:20,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:20:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-21 02:20:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-21 02:20:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:20:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2023-12-21 02:20:20,837 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 73 [2023-12-21 02:20:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:20:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2023-12-21 02:20:20,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:20:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2023-12-21 02:20:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-21 02:20:20,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:20:20,844 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:20:20,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:20:20,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:20:20,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:20:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1065954572, now seen corresponding path program 1 times [2023-12-21 02:20:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:20:20,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585477616] [2023-12-21 02:20:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:20:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:20:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:20:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:20:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:20:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:20:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:20:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:20:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:20:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:20:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:20:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:20:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:20:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585477616] [2023-12-21 02:20:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585477616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:20:21,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:20:21,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:20:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59346746] [2023-12-21 02:20:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:20:21,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:20:21,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:20:21,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:20:21,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:20:21,004 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:20:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:20:21,049 INFO L93 Difference]: Finished difference Result 151 states and 214 transitions. [2023-12-21 02:20:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:20:21,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-12-21 02:20:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:20:21,057 INFO L225 Difference]: With dead ends: 151 [2023-12-21 02:20:21,057 INFO L226 Difference]: Without dead ends: 79 [2023-12-21 02:20:21,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 02:20:21,058 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 10 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:20:21,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:20:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-21 02:20:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2023-12-21 02:20:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:20:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2023-12-21 02:20:21,065 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 73 [2023-12-21 02:20:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:20:21,065 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2023-12-21 02:20:21,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:20:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2023-12-21 02:20:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-21 02:20:21,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:20:21,067 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:20:21,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:20:21,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:20:21,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:20:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1626654350, now seen corresponding path program 1 times [2023-12-21 02:20:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:20:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460253385] [2023-12-21 02:20:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:20:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:20:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:20:21,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:20:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:20:21,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:20:21,213 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:20:21,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:20:21,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:20:21,220 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-21 02:20:21,223 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:20:21,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:20:21 BoogieIcfgContainer [2023-12-21 02:20:21,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:20:21,276 INFO L158 Benchmark]: Toolchain (without parser) took 1791.59ms. Allocated memory is still 289.4MB. Free memory was 244.7MB in the beginning and 196.5MB in the end (delta: 48.2MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2023-12-21 02:20:21,276 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:20:21,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.87ms. Allocated memory is still 289.4MB. Free memory was 244.7MB in the beginning and 230.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 02:20:21,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.58ms. Allocated memory is still 289.4MB. Free memory was 230.6MB in the beginning and 226.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:20:21,277 INFO L158 Benchmark]: Boogie Preprocessor took 52.92ms. Allocated memory is still 289.4MB. Free memory was 226.9MB in the beginning and 223.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:20:21,277 INFO L158 Benchmark]: RCFGBuilder took 461.34ms. Allocated memory is still 289.4MB. Free memory was 223.3MB in the beginning and 198.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-21 02:20:21,278 INFO L158 Benchmark]: TraceAbstraction took 1011.41ms. Allocated memory is still 289.4MB. Free memory was 197.6MB in the beginning and 196.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. [2023-12-21 02:20:21,279 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.14ms. Allocated memory is still 196.1MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.87ms. Allocated memory is still 289.4MB. Free memory was 244.7MB in the beginning and 230.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.58ms. Allocated memory is still 289.4MB. Free memory was 230.6MB in the beginning and 226.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.92ms. Allocated memory is still 289.4MB. Free memory was 226.9MB in the beginning and 223.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 461.34ms. Allocated memory is still 289.4MB. Free memory was 223.3MB in the beginning and 198.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1011.41ms. Allocated memory is still 289.4MB. Free memory was 197.6MB in the beginning and 196.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double last_1_WrapperStruct0_var_1_5 = 5.25; [L46] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L47] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_5 [L98] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L83] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L84] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L84] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L86] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_3 [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_3 [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L88] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_4 [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_4 [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L90] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L111] RET updateVariables() [L112] CALL step() [L51] WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L51] COND FALSE !(WrapperStruct0.var_1_9) [L56] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L61] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L61] COND TRUE ! WrapperStruct0.var_1_2 [L62] EXPR WrapperStruct0.var_1_3 [L62] EXPR WrapperStruct0.var_1_4 [L62] WrapperStruct0.var_1_1 = (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4) [L66] EXPR WrapperStruct0.var_1_3 [L66] EXPR WrapperStruct0.var_1_4 [L66] EXPR WrapperStruct0.var_1_1 [L66] EXPR WrapperStruct0.var_1_1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L66] COND FALSE !((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) [L79] EXPR WrapperStruct0.var_1_3 [L79] WrapperStruct0.var_1_5 = WrapperStruct0.var_1_3 [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3))))) [L103] EXPR WrapperStruct0.var_1_1 [L103] EXPR WrapperStruct0.var_1_3 [L103] EXPR WrapperStruct0.var_1_4 [L103] EXPR (! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3))))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103-L104] return ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 197 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 224/224 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-21 02:20:21,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...