/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:03:13,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:03:13,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 15:03:13,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:03:13,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:03:13,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:03:13,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:03:13,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:03:13,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:03:13,514 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:03:13,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:03:13,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:03:13,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:03:13,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:03:13,515 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:03:13,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:03:13,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:03:13,521 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:03:13,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:03:13,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:03:13,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:03:13,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:03:13,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:03:13,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:03:13,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:03:13,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:03:13,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:03:13,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:03:13,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:03:13,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:03:13,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:03:13,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:03:13,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:03:13,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:03:13,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:03:13,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:03:13,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:03:13,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:03:13,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:03:13,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:03:13,527 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:03:13,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:03:13,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:03:13,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:03:13,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:03:13,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:03:13,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:03:13,695 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:03:13,695 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:03:13,696 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-50.i [2023-12-19 15:03:14,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:03:14,896 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:03:14,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2023-12-19 15:03:14,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df532dd/2bcb01ae92db45fd9eddf587f568ad5f/FLAG63d17c882 [2023-12-19 15:03:14,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df532dd/2bcb01ae92db45fd9eddf587f568ad5f [2023-12-19 15:03:14,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:03:14,927 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:03:14,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:03:14,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:03:14,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:03:14,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:03:14" (1/1) ... [2023-12-19 15:03:14,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db6a69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:14, skipping insertion in model container [2023-12-19 15:03:14,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:03:14" (1/1) ... [2023-12-19 15:03:14,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:03:15,062 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-50.i[916,929] [2023-12-19 15:03:15,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:03:15,122 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:03:15,130 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-50.i[916,929] [2023-12-19 15:03:15,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:03:15,183 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:03:15,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15 WrapperNode [2023-12-19 15:03:15,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:03:15,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:03:15,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:03:15,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:03:15,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,229 INFO L138 Inliner]: procedures = 29, calls = 211, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 598 [2023-12-19 15:03:15,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:03:15,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:03:15,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:03:15,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:03:15,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,270 INFO L175 MemorySlicer]: Split 170 memory accesses to 5 slices as follows [2, 31, 40, 30, 67]. 39 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 4, 4, 4, 6]. The 23 writes are split as follows [0, 7, 4, 5, 7]. [2023-12-19 15:03:15,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:03:15,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:03:15,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:03:15,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:03:15,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (1/1) ... [2023-12-19 15:03:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:03:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:03:15,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 15:03:15,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:03:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:03:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:03:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:03:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:03:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:03:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:03:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:03:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:03:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:03:15,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:03:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:03:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:03:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:03:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:03:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:03:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:03:15,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:03:15,518 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:03:15,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:03:15,903 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:03:15,948 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:03:15,948 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:03:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:03:15 BoogieIcfgContainer [2023-12-19 15:03:15,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:03:15,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:03:15,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:03:15,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:03:15,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:03:14" (1/3) ... [2023-12-19 15:03:15,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c457109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:03:15, skipping insertion in model container [2023-12-19 15:03:15,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:15" (2/3) ... [2023-12-19 15:03:15,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c457109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:03:15, skipping insertion in model container [2023-12-19 15:03:15,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:03:15" (3/3) ... [2023-12-19 15:03:15,958 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-50.i [2023-12-19 15:03:15,971 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:03:15,971 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:03:16,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:03:16,011 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;@1713e353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:03:16,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:03:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:03:16,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-19 15:03:16,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:16,036 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:03:16,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:16,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:16,043 INFO L85 PathProgramCache]: Analyzing trace with hash -756411627, now seen corresponding path program 1 times [2023-12-19 15:03:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117861984] [2023-12-19 15:03:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:03:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:03:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:03:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:03:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:03:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:03:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:03:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:03:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:03:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:03:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:03:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:03:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:03:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:03:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:03:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:03:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:03:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:03:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:03:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:03:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:03:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:03:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:03:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:03:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-19 15:03:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-19 15:03:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-19 15:03:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:03:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117861984] [2023-12-19 15:03:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117861984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:03:16,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:03:16,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:03:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36823546] [2023-12-19 15:03:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:03:16,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:03:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:03:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:03:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:03:16,515 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-19 15:03:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:03:16,559 INFO L93 Difference]: Finished difference Result 243 states and 394 transitions. [2023-12-19 15:03:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:03:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2023-12-19 15:03:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:03:16,570 INFO L225 Difference]: With dead ends: 243 [2023-12-19 15:03:16,570 INFO L226 Difference]: Without dead ends: 121 [2023-12-19 15:03:16,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:03:16,580 INFO L413 NwaCegarLoop]: 176 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, 176 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-19 15:03:16,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:03:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-19 15:03:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-19 15:03:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:03:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2023-12-19 15:03:16,619 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 190 [2023-12-19 15:03:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:03:16,620 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2023-12-19 15:03:16,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-19 15:03:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2023-12-19 15:03:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-19 15:03:16,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:16,625 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:03:16,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:03:16,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:16,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1594807657, now seen corresponding path program 1 times [2023-12-19 15:03:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:16,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782127760] [2023-12-19 15:03:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:03:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:03:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:03:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:03:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:03:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:03:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:03:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:03:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:03:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:03:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:03:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:03:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:03:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:03:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:03:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:03:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:03:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:03:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:03:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:03:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:03:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:03:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:03:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:03:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-19 15:03:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-19 15:03:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-19 15:03:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:03:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782127760] [2023-12-19 15:03:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782127760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:03:17,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:03:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:03:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736262540] [2023-12-19 15:03:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:03:17,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:03:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:03:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:03:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:03:17,122 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-19 15:03:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:03:17,351 INFO L93 Difference]: Finished difference Result 391 states and 582 transitions. [2023-12-19 15:03:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:03:17,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2023-12-19 15:03:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:03:17,357 INFO L225 Difference]: With dead ends: 391 [2023-12-19 15:03:17,357 INFO L226 Difference]: Without dead ends: 271 [2023-12-19 15:03:17,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:03:17,359 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 297 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:03:17,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 726 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:03:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-19 15:03:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2023-12-19 15:03:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3869346733668342) internal successors, (276), 199 states have internal predecessors, (276), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-19 15:03:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2023-12-19 15:03:17,403 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 190 [2023-12-19 15:03:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:03:17,404 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2023-12-19 15:03:17,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-19 15:03:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2023-12-19 15:03:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-19 15:03:17,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:17,410 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:03:17,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:03:17,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:17,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1478639200, now seen corresponding path program 1 times [2023-12-19 15:03:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040753801] [2023-12-19 15:03:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:03:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:03:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:03:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:03:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:03:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:03:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:03:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:03:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:03:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:03:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:03:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:03:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:03:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:03:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:03:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:03:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:03:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:03:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:03:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:03:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:03:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:03:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:03:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:03:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-19 15:03:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-19 15:03:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-19 15:03:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:03:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040753801] [2023-12-19 15:03:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040753801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:03:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:03:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:03:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877870680] [2023-12-19 15:03:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:03:18,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:03:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:03:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:03:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:03:18,337 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-19 15:03:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:03:18,508 INFO L93 Difference]: Finished difference Result 628 states and 928 transitions. [2023-12-19 15:03:18,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:03:18,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2023-12-19 15:03:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:03:18,512 INFO L225 Difference]: With dead ends: 628 [2023-12-19 15:03:18,512 INFO L226 Difference]: Without dead ends: 375 [2023-12-19 15:03:18,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:03:18,516 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 99 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:03:18,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 935 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:03:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-12-19 15:03:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 346. [2023-12-19 15:03:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 281 states have (on average 1.3807829181494662) internal successors, (388), 283 states have internal predecessors, (388), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 15:03:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 508 transitions. [2023-12-19 15:03:18,539 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 508 transitions. Word has length 190 [2023-12-19 15:03:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:03:18,541 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 508 transitions. [2023-12-19 15:03:18,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-19 15:03:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 508 transitions. [2023-12-19 15:03:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-19 15:03:18,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:18,543 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:03:18,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:03:18,543 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:18,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 592715056, now seen corresponding path program 1 times [2023-12-19 15:03:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203461665] [2023-12-19 15:03:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:03:18,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:03:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:03:18,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:03:18,812 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:03:18,812 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:03:18,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:03:18,816 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-19 15:03:18,818 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:03:18,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:03:18 BoogieIcfgContainer [2023-12-19 15:03:18,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:03:18,905 INFO L158 Benchmark]: Toolchain (without parser) took 3978.14ms. Allocated memory was 216.0MB in the beginning and 288.4MB in the end (delta: 72.4MB). Free memory was 169.2MB in the beginning and 147.7MB in the end (delta: 21.5MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2023-12-19 15:03:18,905 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:03:18,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.46ms. Allocated memory is still 216.0MB. Free memory was 168.8MB in the beginning and 151.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 15:03:18,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.07ms. Allocated memory is still 216.0MB. Free memory was 151.6MB in the beginning and 147.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:03:18,906 INFO L158 Benchmark]: Boogie Preprocessor took 92.64ms. Allocated memory is still 216.0MB. Free memory was 147.1MB in the beginning and 141.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-19 15:03:18,906 INFO L158 Benchmark]: RCFGBuilder took 625.34ms. Allocated memory was 216.0MB in the beginning and 288.4MB in the end (delta: 72.4MB). Free memory was 141.5MB in the beginning and 239.5MB in the end (delta: -98.0MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2023-12-19 15:03:18,906 INFO L158 Benchmark]: TraceAbstraction took 2952.10ms. Allocated memory is still 288.4MB. Free memory was 238.4MB in the beginning and 147.7MB in the end (delta: 90.8MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2023-12-19 15:03:18,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.46ms. Allocated memory is still 216.0MB. Free memory was 168.8MB in the beginning and 151.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.07ms. Allocated memory is still 216.0MB. Free memory was 151.6MB in the beginning and 147.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.64ms. Allocated memory is still 216.0MB. Free memory was 147.1MB in the beginning and 141.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 625.34ms. Allocated memory was 216.0MB in the beginning and 288.4MB in the end (delta: 72.4MB). Free memory was 141.5MB in the beginning and 239.5MB in the end (delta: -98.0MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2952.10ms. Allocated memory is still 288.4MB. Free memory was 238.4MB in the beginning and 147.7MB in the end (delta: 90.8MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L34] signed long int last_1_signed_long_int_Array_0_0__1_ = -5; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR signed_long_int_Array_0[0][1] [L112] last_1_signed_long_int_Array_0_0__1_ = signed_long_int_Array_0[0][1] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] double_Array_0[0][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] double_Array_0[1][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] double_Array_0[0][1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] signed_long_int_Array_0[1][0] = __VERIFIER_nondet_long() [L90] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_long_int_Array_0[1][0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_long_int_Array_0[1][1] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[1][1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[1][1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L96] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L98] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L99] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L99] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L99] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] signed_short_int_Array_0[1][1] = __VERIFIER_nondet_short() [L102] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L102] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L102] RET assume_abort_if_not(signed_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] RET assume_abort_if_not(signed_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L104] signed_short_int_Array_0[0][2] = __VERIFIER_nondet_short() [L105] EXPR signed_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] CALL assume_abort_if_not(signed_short_int_Array_0[0][2] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] RET assume_abort_if_not(signed_short_int_Array_0[0][2] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] EXPR signed_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] CALL assume_abort_if_not(signed_short_int_Array_0[0][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] RET assume_abort_if_not(signed_short_int_Array_0[0][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L107] signed_short_int_Array_0[1][2] = __VERIFIER_nondet_short() [L108] EXPR signed_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L108] CALL assume_abort_if_not(signed_short_int_Array_0[1][2] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L108] RET assume_abort_if_not(signed_short_int_Array_0[1][2] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] EXPR signed_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] CALL assume_abort_if_not(signed_short_int_Array_0[1][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET assume_abort_if_not(signed_short_int_Array_0[1][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L123] RET updateVariables() [L124] CALL step() [L38] signed long int stepLocal_1 = last_1_signed_long_int_Array_0_0__1_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-5] [L39] COND FALSE !(stepLocal_1 >= 0) [L42] EXPR signed_short_int_Array_0[1][0] [L42] EXPR signed_short_int_Array_0[1][2] [L42] EXPR signed_short_int_Array_0[0][1] [L42] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L42] EXPR ((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))) [L42] EXPR signed_short_int_Array_0[1][0] [L42] EXPR ((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-5] [L42] signed_short_int_Array_0[0][0] = ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))) [L44] EXPR signed_short_int_Array_0[1][2] [L44] EXPR signed_long_int_Array_0[1][1] [L44] signed long int stepLocal_3 = signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1]; [L45] EXPR signed_short_int_Array_0[0][0] [L45] signed short int stepLocal_2 = signed_short_int_Array_0[0][0]; [L46] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND FALSE !(signed_short_int_Array_0[0][0] > stepLocal_3) [L51] EXPR signed_short_int_Array_0[0][2] [L51] signed_long_int_Array_0[0][1] = signed_short_int_Array_0[0][2] [L53] EXPR signed_short_int_Array_0[0][0] [L53] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L53] EXPR ((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]) [L53] EXPR signed_short_int_Array_0[0][0] [L53] EXPR ((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-5, stepLocal_2=32765, stepLocal_3=32766] [L53] signed long int stepLocal_0 = (((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1])); [L54] EXPR double_Array_0[1][1] [L54] EXPR double_Array_0[0][1] [L54] EXPR double_Array_0[1][0] [L54] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L54] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) [L54] EXPR double_Array_0[1][1] [L54] EXPR double_Array_0[0][1] [L54] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=32765, stepLocal_1=-5, stepLocal_2=32765, stepLocal_3=32766] [L54] COND TRUE (((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9 [L55] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L55] COND FALSE !(stepLocal_0 < signed_long_int_Array_0[0][1]) [L62] EXPR BOOL_unsigned_char_Array_0[1][0] [L62] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR double_Array_0[1][1] [L115] EXPR double_Array_0[0][1] [L115] EXPR double_Array_0[1][0] [L115] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) [L115] EXPR double_Array_0[1][1] [L115] EXPR double_Array_0[0][1] [L115] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) [L115] EXPR BOOL_unsigned_char_Array_0[1][1] [L115] EXPR BOOL_unsigned_char_Array_0[0][1] [L115] EXPR ((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115-L116] return ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_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: 2.8s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 396 mSDsluCounter, 1837 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1256 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 581 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 15:03:18,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...