/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-a_file-49.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:19:12,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:19:12,893 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-16 04:19:12,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:19:12,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:19:12,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:19:12,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:19:12,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:19:12,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:19:12,925 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:19:12,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:19:12,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:19:12,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:19:12,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:19:12,927 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:19:12,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:19:12,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:19:12,928 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:19:12,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:19:12,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:19:12,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:19:12,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:19:12,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:19:12,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:19:12,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:19:12,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:19:12,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:19:12,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:19:12,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:19:12,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:19:12,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:19:12,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:19:12,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:19:12,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:19:12,932 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:19:12,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:19:12,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:19:12,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:19:13,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:19:13,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:19:13,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:19:13,149 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:19:13,149 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:19:13,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2023-12-16 04:19:14,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:19:14,473 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:19:14,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2023-12-16 04:19:14,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be6e7421/5edb05a63b5a4800a74c8f8259aa2b2c/FLAG1aed78d31 [2023-12-16 04:19:14,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be6e7421/5edb05a63b5a4800a74c8f8259aa2b2c [2023-12-16 04:19:14,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:19:14,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:19:14,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:19:14,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:19:14,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:19:14,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d8d2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14, skipping insertion in model container [2023-12-16 04:19:14,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,533 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:19:14,645 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-a_file-49.i[916,929] [2023-12-16 04:19:14,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:19:14,720 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:19:14,728 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-a_file-49.i[916,929] [2023-12-16 04:19:14,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:19:14,804 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:19:14,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14 WrapperNode [2023-12-16 04:19:14,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:19:14,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:19:14,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:19:14,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:19:14,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,857 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 654 [2023-12-16 04:19:14,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:19:14,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:19:14,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:19:14,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:19:14,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,938 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2023-12-16 04:19:14,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:14,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:15,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:15,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:15,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:15,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:15,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:19:15,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:19:15,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:19:15,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:19:15,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (1/1) ... [2023-12-16 04:19:15,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:19:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:15,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:19:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:19:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:19:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:19:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:19:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:19:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:19:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:19:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:19:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:19:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:19:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:19:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:19:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:19:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:19:15,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:19:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:19:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:19:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:19:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:19:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:19:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:19:15,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:19:15,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:19:15,281 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:19:15,283 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:19:15,737 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:19:15,771 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:19:15,772 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:19:15,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:19:15 BoogieIcfgContainer [2023-12-16 04:19:15,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:19:15,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:19:15,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:19:15,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:19:15,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:19:14" (1/3) ... [2023-12-16 04:19:15,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bddaa26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:19:15, skipping insertion in model container [2023-12-16 04:19:15,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:14" (2/3) ... [2023-12-16 04:19:15,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bddaa26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:19:15, skipping insertion in model container [2023-12-16 04:19:15,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:19:15" (3/3) ... [2023-12-16 04:19:15,781 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2023-12-16 04:19:15,794 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:19:15,794 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:19:15,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:19:15,858 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;@4fb37e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:19:15,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:19:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:19:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:19:15,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:15,875 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:15,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:15,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash -568812109, now seen corresponding path program 1 times [2023-12-16 04:19:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58284653] [2023-12-16 04:19:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:19:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:19:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:19:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:19:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:19:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:19:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:19:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:19:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58284653] [2023-12-16 04:19:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58284653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:19:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912625793] [2023-12-16 04:19:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:16,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:19:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:19:16,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:19:16,310 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:19:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:16,361 INFO L93 Difference]: Finished difference Result 243 states and 388 transitions. [2023-12-16 04:19:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:19:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2023-12-16 04:19:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:16,371 INFO L225 Difference]: With dead ends: 243 [2023-12-16 04:19:16,372 INFO L226 Difference]: Without dead ends: 121 [2023-12-16 04:19:16,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:19:16,378 INFO L413 NwaCegarLoop]: 179 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, 179 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-16 04:19:16,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:19:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-16 04:19:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-16 04:19:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 105 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:19:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2023-12-16 04:19:16,430 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 110 [2023-12-16 04:19:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:16,431 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2023-12-16 04:19:16,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:19:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2023-12-16 04:19:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:19:16,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:16,434 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:16,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:19:16,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:16,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash 179971931, now seen corresponding path program 1 times [2023-12-16 04:19:16,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:16,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364092525] [2023-12-16 04:19:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:19:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:19:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:19:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:19:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:19:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:19:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:19:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:19:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364092525] [2023-12-16 04:19:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364092525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:19:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404581607] [2023-12-16 04:19:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:17,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:19:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:17,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:19:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:19:17,183 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:19:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:17,471 INFO L93 Difference]: Finished difference Result 381 states and 577 transitions. [2023-12-16 04:19:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:19:17,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2023-12-16 04:19:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:17,474 INFO L225 Difference]: With dead ends: 381 [2023-12-16 04:19:17,474 INFO L226 Difference]: Without dead ends: 261 [2023-12-16 04:19:17,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:19:17,475 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 236 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:17,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 821 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:19:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-16 04:19:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 125. [2023-12-16 04:19:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.4678899082568808) internal successors, (160), 109 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:19:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2023-12-16 04:19:17,486 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 110 [2023-12-16 04:19:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:17,487 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2023-12-16 04:19:17,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:19:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2023-12-16 04:19:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:19:17,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:17,488 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:19:17,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:19:17,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:17,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash 558927264, now seen corresponding path program 1 times [2023-12-16 04:19:17,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:17,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963946472] [2023-12-16 04:19:17,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:17,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:19:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:19:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:19:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:19:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:19:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:19:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:19:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 04:19:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:18,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963946472] [2023-12-16 04:19:18,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963946472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:18,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476799604] [2023-12-16 04:19:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:18,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:18,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:19:18,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:19:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:18,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 04:19:18,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:19:18,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 04:19:18,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2023-12-16 04:19:18,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:18,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 80 [2023-12-16 04:19:18,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-12-16 04:19:18,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 34 [2023-12-16 04:19:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-16 04:19:18,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:19:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 04:19:18,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476799604] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:19:18,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:19:18,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2023-12-16 04:19:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166202105] [2023-12-16 04:19:18,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:19:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:19:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:19:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:19:18,806 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 15 states, 12 states have (on average 7.0) internal successors, (84), 15 states have internal predecessors, (84), 7 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 7 states have call successors, (41) [2023-12-16 04:19:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:19,527 INFO L93 Difference]: Finished difference Result 334 states and 500 transitions. [2023-12-16 04:19:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:19:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.0) internal successors, (84), 15 states have internal predecessors, (84), 7 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 7 states have call successors, (41) Word has length 112 [2023-12-16 04:19:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:19,529 INFO L225 Difference]: With dead ends: 334 [2023-12-16 04:19:19,529 INFO L226 Difference]: Without dead ends: 210 [2023-12-16 04:19:19,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 243 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2023-12-16 04:19:19,530 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1532 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:19,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 561 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:19:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-16 04:19:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 129. [2023-12-16 04:19:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 112 states have internal predecessors, (162), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:19:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2023-12-16 04:19:19,539 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 112 [2023-12-16 04:19:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:19,539 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2023-12-16 04:19:19,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.0) internal successors, (84), 15 states have internal predecessors, (84), 7 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 7 states have call successors, (41) [2023-12-16 04:19:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2023-12-16 04:19:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:19:19,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:19,541 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:19:19,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 04:19:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:19,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:19,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash -839906842, now seen corresponding path program 1 times [2023-12-16 04:19:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290201365] [2023-12-16 04:19:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:19:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:19:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:19:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:19:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:19:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:19:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:19:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:19:20,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:20,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290201365] [2023-12-16 04:19:20,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290201365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:20,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:20,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 04:19:20,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909579046] [2023-12-16 04:19:20,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:20,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 04:19:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:20,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 04:19:20,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:19:20,900 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:19:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:21,523 INFO L93 Difference]: Finished difference Result 488 states and 719 transitions. [2023-12-16 04:19:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:19:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2023-12-16 04:19:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:21,525 INFO L225 Difference]: With dead ends: 488 [2023-12-16 04:19:21,525 INFO L226 Difference]: Without dead ends: 360 [2023-12-16 04:19:21,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2023-12-16 04:19:21,527 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 656 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:21,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 2027 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:19:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-16 04:19:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 292. [2023-12-16 04:19:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 267 states have (on average 1.4831460674157304) internal successors, (396), 268 states have internal predecessors, (396), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:19:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 436 transitions. [2023-12-16 04:19:21,542 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 436 transitions. Word has length 114 [2023-12-16 04:19:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:21,542 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 436 transitions. [2023-12-16 04:19:21,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:19:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 436 transitions. [2023-12-16 04:19:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:19:21,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:21,543 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:19:21,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:19:21,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:21,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -58135251, now seen corresponding path program 1 times [2023-12-16 04:19:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361551169] [2023-12-16 04:19:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:19:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:19:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:19:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:19:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:19:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:19:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:19:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 04:19:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361551169] [2023-12-16 04:19:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361551169] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713621401] [2023-12-16 04:19:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:22,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:22,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:22,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:19:22,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:19:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:22,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:19:22,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:19:22,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:19:22,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2023-12-16 04:19:22,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-12-16 04:19:22,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:22,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-12-16 04:19:22,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:22,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 15 [2023-12-16 04:19:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-16 04:19:22,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:19:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 04:19:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713621401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:19:22,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:19:22,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2023-12-16 04:19:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502777205] [2023-12-16 04:19:22,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:19:22,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 04:19:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 04:19:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:19:22,848 INFO L87 Difference]: Start difference. First operand 292 states and 436 transitions. Second operand has 19 states, 16 states have (on average 6.1875) internal successors, (99), 19 states have internal predecessors, (99), 8 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 8 states have call successors, (32) [2023-12-16 04:19:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:24,243 INFO L93 Difference]: Finished difference Result 1364 states and 2018 transitions. [2023-12-16 04:19:24,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-16 04:19:24,243 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.1875) internal successors, (99), 19 states have internal predecessors, (99), 8 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 8 states have call successors, (32) Word has length 114 [2023-12-16 04:19:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:24,250 INFO L225 Difference]: With dead ends: 1364 [2023-12-16 04:19:24,250 INFO L226 Difference]: Without dead ends: 1073 [2023-12-16 04:19:24,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 245 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=576, Invalid=1874, Unknown=0, NotChecked=0, Total=2450 [2023-12-16 04:19:24,253 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1731 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:24,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 1075 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 04:19:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2023-12-16 04:19:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 312. [2023-12-16 04:19:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 285 states have (on average 1.4736842105263157) internal successors, (420), 286 states have internal predecessors, (420), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:19:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 460 transitions. [2023-12-16 04:19:24,283 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 460 transitions. Word has length 114 [2023-12-16 04:19:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:24,284 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 460 transitions. [2023-12-16 04:19:24,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.1875) internal successors, (99), 19 states have internal predecessors, (99), 8 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 8 states have call successors, (32) [2023-12-16 04:19:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 460 transitions. [2023-12-16 04:19:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:19:24,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:24,286 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:19:24,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:19:24,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:24,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:24,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:24,493 INFO L85 PathProgramCache]: Analyzing trace with hash 200030187, now seen corresponding path program 1 times [2023-12-16 04:19:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816039128] [2023-12-16 04:19:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:19:24,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:19:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:19:24,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:19:24,677 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:19:24,678 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:19:24,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:19:24,682 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 04:19:24,684 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:19:24,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:19:24 BoogieIcfgContainer [2023-12-16 04:19:24,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:19:24,769 INFO L158 Benchmark]: Toolchain (without parser) took 10269.30ms. Allocated memory was 201.3MB in the beginning and 471.9MB in the end (delta: 270.5MB). Free memory was 155.7MB in the beginning and 406.6MB in the end (delta: -250.9MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2023-12-16 04:19:24,769 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:19:24,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.75ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 138.0MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:19:24,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.24ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 132.4MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:19:24,784 INFO L158 Benchmark]: Boogie Preprocessor took 218.37ms. Allocated memory was 201.3MB in the beginning and 296.7MB in the end (delta: 95.4MB). Free memory was 132.4MB in the beginning and 267.8MB in the end (delta: -135.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 04:19:24,785 INFO L158 Benchmark]: RCFGBuilder took 695.64ms. Allocated memory is still 296.7MB. Free memory was 267.8MB in the beginning and 224.8MB in the end (delta: 43.0MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2023-12-16 04:19:24,785 INFO L158 Benchmark]: TraceAbstraction took 8994.78ms. Allocated memory was 296.7MB in the beginning and 471.9MB in the end (delta: 175.1MB). Free memory was 224.3MB in the beginning and 406.6MB in the end (delta: -182.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:19:24,786 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 201.3MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.75ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 138.0MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.24ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 132.4MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 218.37ms. Allocated memory was 201.3MB in the beginning and 296.7MB in the end (delta: 95.4MB). Free memory was 132.4MB in the beginning and 267.8MB in the end (delta: -135.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * RCFGBuilder took 695.64ms. Allocated memory is still 296.7MB. Free memory was 267.8MB in the beginning and 224.8MB in the end (delta: 43.0MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8994.78ms. Allocated memory was 296.7MB in the beginning and 471.9MB in the end (delta: 175.1MB). Free memory was 224.3MB in the beginning and 406.6MB in the end (delta: -182.3MB). 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 someBinaryFLOATComparisonOperation at line 91, overapproximation of bitwise operation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L99] RET updateVariables() [L100] CALL step() [L37] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[0] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] signed_short_int_Array_0[1] = ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))) [L38] EXPR unsigned_short_int_Array_0[0][1] [L38] EXPR 50 >> unsigned_short_int_Array_0[0][1] [L38] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] COND FALSE !((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) [L41] EXPR BOOL_unsigned_char_Array_0[1][1] [L41] BOOL_unsigned_char_Array_0[0][1] = (! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] COND FALSE !(unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) [L47] EXPR BOOL_unsigned_char_Array_0[1][1] [L47] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE float_Array_0[1] >= 64.5f [L51] EXPR float_Array_0[1] [L51] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L51] COND FALSE !(float_Array_0[1] >= float_Array_0[0]) [L54] BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1][0]) [L57] EXPR unsigned_short_int_Array_0[0][0] [L57] unsigned_short_int_Array_0[1][1] = unsigned_short_int_Array_0[0][0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) [L91] EXPR unsigned_short_int_Array_0[1][1] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91-L92] return ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4156 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4155 mSDsluCounter, 4663 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3847 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3510 IncrementalHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 816 mSDtfsCounter, 3510 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 593 SyntacticMatches, 8 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=5, InterpolantAutomatonStates: 75, 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, 1046 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 6255 SizeOfPredicates, 12 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 3078/3276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:19:24,803 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...