./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-fpi/ifeqn5f.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/ifeqn5f.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0a70ae82 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/array-fpi/ifeqn5f.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/ifeqn5f.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 13:44:51,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 13:44:51,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 13:44:51,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 13:44:51,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 13:44:51,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 13:44:51,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 13:44:51,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 13:44:51,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 13:44:51,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 13:44:51,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 13:44:51,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 13:44:51,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 13:44:51,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 13:44:51,701 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 13:44:51,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 13:44:51,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 13:44:51,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 13:44:51,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 13:44:51,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 13:44:51,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 13:44:51,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 13:44:51,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 13:44:51,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 13:44:51,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 13:44:51,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 13:44:51,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 13:44:51,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 13:44:51,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 13:44:51,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 13:44:51,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 13:44:51,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 13:44:51,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 13:44:51,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 13:44:51,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 13:44:51,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 13:44:51,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 13:44:51,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 13:44:51,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 13:44:51,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 13:44:51,710 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 13:44:51,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 13:44:51,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 13:44:51,711 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 13:44:51,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 13:44:51,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 13:44:51,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 13:44:51,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 13:44:51,996 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 13:44:51,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifeqn5f.c [2024-08-07 13:44:53,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 13:44:53,465 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 13:44:53,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn5f.c [2024-08-07 13:44:53,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db36d701/53ea0fc7445b417c85c74f151e2d16b9/FLAGccb9b8b48 [2024-08-07 13:44:53,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db36d701/53ea0fc7445b417c85c74f151e2d16b9 [2024-08-07 13:44:53,864 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 13:44:53,865 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 13:44:53,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/ifeqn5f.yml/witness.yml [2024-08-07 13:44:53,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 13:44:53,917 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 13:44:53,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 13:44:53,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 13:44:53,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 13:44:53,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:44:53" (1/2) ... [2024-08-07 13:44:53,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51afee5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:53, skipping insertion in model container [2024-08-07 13:44:53,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:44:53" (1/2) ... [2024-08-07 13:44:53,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@655eeeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:53, skipping insertion in model container [2024-08-07 13:44:53,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:53" (2/2) ... [2024-08-07 13:44:53,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51afee5b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:53, skipping insertion in model container [2024-08-07 13:44:53,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:53" (2/2) ... [2024-08-07 13:44:53,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 13:44:54,066 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn5f.c[590,603] [2024-08-07 13:44:54,086 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:44:54,094 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 13:44:54,103 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn5f.c[590,603] [2024-08-07 13:44:54,108 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:44:54,122 INFO L204 MainTranslator]: Completed translation [2024-08-07 13:44:54,122 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54 WrapperNode [2024-08-07 13:44:54,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 13:44:54,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 13:44:54,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 13:44:54,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 13:44:54,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,150 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2024-08-07 13:44:54,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 13:44:54,163 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 13:44:54,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 13:44:54,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 13:44:54,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (1/1) ... [2024-08-07 13:44:54,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 13:44:54,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 13:44:54,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 13:44:54,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 13:44:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 13:44:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 13:44:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 13:44:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 13:44:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-07 13:44:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 13:44:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 13:44:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 13:44:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 13:44:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 13:44:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 13:44:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 13:44:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 13:44:54,291 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 13:44:54,293 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 13:44:54,480 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-07 13:44:54,481 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 13:44:54,489 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 13:44:54,490 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 13:44:54,490 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:44:54 BoogieIcfgContainer [2024-08-07 13:44:54,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 13:44:54,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 13:44:54,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 13:44:54,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 13:44:54,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 01:44:53" (1/4) ... [2024-08-07 13:44:54,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ef0d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:44:54, skipping insertion in model container [2024-08-07 13:44:54,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:53" (2/4) ... [2024-08-07 13:44:54,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ef0d21 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 01:44:54, skipping insertion in model container [2024-08-07 13:44:54,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:54" (3/4) ... [2024-08-07 13:44:54,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ef0d21 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 01:44:54, skipping insertion in model container [2024-08-07 13:44:54,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:44:54" (4/4) ... [2024-08-07 13:44:54,502 INFO L119 eAbstractionObserver]: Analyzing ICFG ifeqn5f.c [2024-08-07 13:44:54,502 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 13:44:54,521 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 13:44:54,521 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 13:44:54,564 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,564 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,569 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,569 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,572 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,573 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,574 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,575 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,576 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,576 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,577 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,578 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,579 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,579 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,579 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,580 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,581 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,583 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,583 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,584 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,584 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,584 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,584 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,585 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,585 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,585 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,585 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,585 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,586 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,586 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,587 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,587 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,591 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,592 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,592 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,592 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,593 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,593 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,595 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,595 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,595 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,595 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,595 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,595 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,596 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,596 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,596 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,597 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,597 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,598 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,598 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,598 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,598 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,598 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,598 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,599 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,599 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,599 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,599 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,599 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,600 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,601 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,601 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,601 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,602 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,602 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,602 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,602 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,603 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,603 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,604 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,604 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,604 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,604 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,604 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,605 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,605 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,605 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,606 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,606 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,606 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,606 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,607 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,607 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,608 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,608 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,608 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,608 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,608 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,609 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,609 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,609 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,610 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,611 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,612 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,613 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,613 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,614 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,615 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,615 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,615 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,615 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,616 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,616 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,617 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,617 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,618 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,618 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,618 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,618 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,618 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,619 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,619 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,619 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,619 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,619 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,620 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,620 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,620 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,620 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,620 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,621 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,622 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,622 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,622 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,622 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,623 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,623 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,623 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,623 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,625 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,625 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,625 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,625 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,625 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,626 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,626 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,626 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,626 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,626 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,627 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,627 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,627 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,627 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,628 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,628 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,628 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,628 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,629 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,629 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,629 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,629 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,630 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,630 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,631 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,631 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,631 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,632 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,632 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,632 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,632 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,632 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,633 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,633 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,633 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,634 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,635 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,635 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,635 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,635 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,635 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,636 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,636 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,636 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,639 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,639 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,640 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,640 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,640 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,641 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,642 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,642 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,642 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,643 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,643 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,643 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,643 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,643 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,644 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,644 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,644 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,644 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,644 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,645 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,645 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,645 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,646 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,646 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,646 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,646 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,646 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,646 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,647 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,649 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,649 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,649 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,649 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,650 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,651 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,653 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,654 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,655 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,655 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,655 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,655 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,655 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,656 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,656 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,656 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,658 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,659 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,660 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,661 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,662 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,662 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,662 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,662 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,664 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,665 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,665 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,665 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,665 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,665 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,665 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,666 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,667 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,668 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,669 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,669 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,669 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,669 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,669 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,670 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,671 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,671 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,671 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,671 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,672 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,673 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,673 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,673 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,673 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,675 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,676 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,676 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,676 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,676 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,688 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,688 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,688 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,689 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,690 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,691 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,691 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,691 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,691 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,692 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,693 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,694 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,694 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,694 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,694 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,694 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,694 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,695 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,696 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,697 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,698 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,699 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,699 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,699 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,699 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,702 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,702 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,703 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,703 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,703 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,703 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,703 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,703 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,704 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,705 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,705 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,705 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,705 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,707 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,708 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,708 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,708 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,708 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,709 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,709 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,709 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,709 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,724 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "call #t~ret14 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "#res := 1;" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "havoc #t~mem12;" "SUMMARY for call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); srcloc: L51-1" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "~i~0 := 0;" "#t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11;" "assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);" "assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "~i~0 := 0;" "#t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8;" "assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "havoc ~i~0;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8 * ~N~0 % 4294967296);~b~0.base, ~b~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;~i~0 := 0;" "SUMMARY for call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0)); srcloc: L25-1" "assume ~N~0 <= 0;#res := 1;" "assume !(~N~0 <= 0);" "havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "assume true;" "SUMMARY for call #t~ret14 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" "assume false;" "assume false;" "assume !false;" "assume 0 == ~cond;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" }, returnAlphabet = {"#50#return;" "#52#return;" "#54#return;" "#56#return;" }, states = {"CountingPredicate [underlying: 14#L51true, annotation: [5, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 22#L33true, annotation: [2, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [14, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 6#L31true, annotation: [5, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 5#L25true, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 38#L15true, annotation: [5, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]" "CountingPredicate [underlying: 13#Loop~1true, annotation: [2, 0]]" "CountingPredicate [underlying: 28#L31-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [14, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [8, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 38#L15true, annotation: [14, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [5, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 23#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 29#L40-3true, annotation: [2, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [7, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 6#L31true, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]" "CountingPredicate [underlying: 13#Loop~1true, annotation: [9, 0]]" "CountingPredicate [underlying: 14#L51true, annotation: [14, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [7, 0]]" "CountingPredicate [underlying: 18#L49-3true, annotation: [10, 0]]" "CountingPredicate [underlying: 18#L49-3true, annotation: [2, 0]]" "CountingPredicate [underlying: 38#L15true, annotation: [7, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [12, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [8, 0]]" "CountingPredicate [underlying: 26#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [14, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 13#Loop~1true, annotation: [8, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [8, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]" "CountingPredicate [underlying: 18#L49-3true, annotation: [7, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [2, 0]]" "CountingPredicate [underlying: 24#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 28#L31-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [10, 0]]" "CountingPredicate [underlying: 38#L15true, annotation: [8, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 25#L42true, annotation: [9, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [7, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [11, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [14, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 14#L51true, annotation: [4, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 6#L31true, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 14#L51true, annotation: [12, 0]]" "CountingPredicate [underlying: 11#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 18#L49-3true, annotation: [8, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [14, 0]]" "CountingPredicate [underlying: 25#L42true, annotation: [8, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [12, 0]]" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 22#L33true, annotation: [6, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [2, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [12, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 35#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [2, 0]]" "CountingPredicate [underlying: 18#L49-3true, annotation: [5, 0]]" "CountingPredicate [underlying: 29#L40-3true, annotation: [7, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [10, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 33#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [4, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [12, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 14#L51true, annotation: [2, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 38#L15true, annotation: [2, 0]]" "CountingPredicate [underlying: 40#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [12, 0]]" "CountingPredicate [underlying: 25#L42true, annotation: [2, 0]]" "CountingPredicate [underlying: 35#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]" "CountingPredicate [underlying: 13#Loop~1true, annotation: [5, 0]]" "CountingPredicate [underlying: 28#L31-2true, annotation: [6, 0]]" "CountingPredicate [underlying: 33#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [11, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [8, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [14, 0]]" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [12, 0]]" "CountingPredicate [underlying: 27#L13true, annotation: [2, 0]]" "CountingPredicate [underlying: 5#L25true, annotation: [2, 0]]" "CountingPredicate [underlying: 25#L42true, annotation: [5, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [4, 0]]" "CountingPredicate [underlying: 29#L40-3true, annotation: [5, 0]]" "CountingPredicate [underlying: 13#Loop~1true, annotation: [4, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]" "CountingPredicate [underlying: 14#L51true, annotation: [7, 0]]" "CountingPredicate [underlying: 20#L15-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [12, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [11, 0]]" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 36#L49-2true, annotation: [11, 0]]" "CountingPredicate [underlying: 19#Loop~2true, annotation: [5, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 29#L40-3true, annotation: [4, 0]]" "CountingPredicate [underlying: 22#L33true, annotation: [5, 0]]" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 6#L31true, annotation: [6, 0]]" "CountingPredicate [underlying: 25#L42true, annotation: [4, 0]]" "CountingPredicate [underlying: 38#L15true, annotation: [4, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [14, 0]]" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 17#L49true, annotation: [5, 0]]" "CountingPredicate [underlying: 14#L51true, annotation: [8, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 18#L49-3true, annotation: [4, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 30#L53true, annotation: [5, 0]]" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L51-2true, annotation: [8, 0]]" }, initialStates = {"CountingPredicate [underlying: 24#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [14, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 7#L51-1true, annotation: [5, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [12, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "CountingPredicate [underlying: 40#assume_abort_if_notENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [4, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 24#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 23#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [7, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [14, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [8, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [11, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "call #t~ret14 := main();" "CountingPredicate [underlying: 26#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 7#L51-1true, annotation: [2, 0]]" "call __VERIFIER_assert((if #t~mem12 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 14#L51true, annotation: [5, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [8, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [8, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [8, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [14, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 22#L33true, annotation: [2, 0]]" "assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]") ("CountingPredicate [underlying: 22#L33true, annotation: [2, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]" "#t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8;" "CountingPredicate [underlying: 6#L31true, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [14, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [14, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 25#L42true, annotation: [2, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 18#L49-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 28#L31-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 29#L40-3true, annotation: [5, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 5#L25true, annotation: [4, 0]]" "havoc ~i~0;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8 * ~N~0 % 4294967296);~b~0.base, ~b~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;~i~0 := 0;" "CountingPredicate [underlying: 6#L31true, annotation: [4, 0]]") ("CountingPredicate [underlying: 38#L15true, annotation: [5, 0]]" "assume false;" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 18#L49-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 13#Loop~1true, annotation: [2, 0]]" "#t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11;" "CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]") ("CountingPredicate [underlying: 28#L31-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L33true, annotation: [2, 0]]") ("CountingPredicate [underlying: 28#L31-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 29#L40-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [14, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [14, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [14, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [14, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [14, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [2, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [2, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [8, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 38#L15true, annotation: [14, 0]]" "assume false;" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [8, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [8, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 23#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "CountingPredicate [underlying: 32#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 29#L40-3true, annotation: [2, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [7, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [7, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]" "#t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8;" "CountingPredicate [underlying: 6#L31true, annotation: [5, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 28#L31-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 29#L40-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [2, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [8, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]" "assume !true;" "CountingPredicate [underlying: 18#L49-3true, annotation: [10, 0]]") ("CountingPredicate [underlying: 13#Loop~1true, annotation: [9, 0]]" "#t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11;" "CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]") ("CountingPredicate [underlying: 14#L51true, annotation: [14, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [14, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [7, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [7, 0]]") ("CountingPredicate [underlying: 18#L49-3true, annotation: [10, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 17#L49true, annotation: [10, 0]]") ("CountingPredicate [underlying: 18#L49-3true, annotation: [2, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 17#L49true, annotation: [2, 0]]") ("CountingPredicate [underlying: 38#L15true, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [7, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [7, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [7, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [8, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [8, 0]]") ("CountingPredicate [underlying: 26#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4;" "CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [14, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [14, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [14, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [14, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 13#Loop~1true, annotation: [8, 0]]" "#t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11;" "CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [8, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 18#L49-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L49-3true, annotation: [7, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 17#L49true, annotation: [7, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [5, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [2, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 28#L31-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L33true, annotation: [5, 0]]") ("CountingPredicate [underlying: 28#L31-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 29#L40-3true, annotation: [5, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [4, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [10, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 38#L15true, annotation: [8, 0]]" "assume false;" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [9, 0]]" "assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);" "CountingPredicate [underlying: 13#Loop~1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [9, 0]]" "assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;" "CountingPredicate [underlying: 13#Loop~1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 25#L42true, annotation: [8, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 18#L49-3true, annotation: [8, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [11, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [11, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [14, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [14, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 14#L51true, annotation: [4, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [14, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [14, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 28#L31-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 29#L40-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [4, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [7, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [7, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [7, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 14#L51true, annotation: [12, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [12, 0]]") ("CountingPredicate [underlying: 18#L49-3true, annotation: [8, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 17#L49true, annotation: [8, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [5, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [5, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [8, 0]]" "assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);" "CountingPredicate [underlying: 13#Loop~1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [8, 0]]" "assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;" "CountingPredicate [underlying: 13#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 25#L42true, annotation: [9, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 18#L49-3true, annotation: [10, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [12, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [12, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 22#L33true, annotation: [6, 0]]" "assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]") ("CountingPredicate [underlying: 22#L33true, annotation: [6, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]" "#t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8;" "CountingPredicate [underlying: 6#L31true, annotation: [2, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [2, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [2, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [12, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [12, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [12, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [12, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [5, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [4, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [4, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [4, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [2, 0]]") ("CountingPredicate [underlying: 18#L49-3true, annotation: [5, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 17#L49true, annotation: [5, 0]]") ("CountingPredicate [underlying: 29#L40-3true, annotation: [7, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [4, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [4, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 11#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [11, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [10, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [10, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [14, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 33#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 35#assume_abort_if_notEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [4, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [14, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [14, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [14, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [12, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [12, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 14#L51true, annotation: [2, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [5, 0]]") ("CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]" "assume ~N~0 <= 0;#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]" "assume !(~N~0 <= 0);" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 38#L15true, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 40#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 27#L13true, annotation: [2, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [12, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [12, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [12, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [2, 0]]" "assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);" "CountingPredicate [underlying: 13#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [2, 0]]" "assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;" "CountingPredicate [underlying: 13#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 18#L49-3true, annotation: [5, 0]]") ("CountingPredicate [underlying: 13#Loop~1true, annotation: [5, 0]]" "#t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11;" "CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 28#L31-2true, annotation: [6, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L33true, annotation: [6, 0]]") ("CountingPredicate [underlying: 28#L31-2true, annotation: [6, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 29#L40-3true, annotation: [7, 0]]") ("CountingPredicate [underlying: 33#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 35#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [5, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [5, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [5, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [11, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [13, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [14, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [13, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [14, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [14, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [4, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [7, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [2, 0]]") ("CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 25#L42true, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 18#L49-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [12, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [12, 0]]") ("CountingPredicate [underlying: 27#L13true, annotation: [2, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 33#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 27#L13true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 33#assume_abort_if_notFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 5#L25true, annotation: [2, 0]]" "havoc ~i~0;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8 * ~N~0 % 4294967296);~b~0.base, ~b~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;~i~0 := 0;" "CountingPredicate [underlying: 6#L31true, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [5, 0]]" "assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);" "CountingPredicate [underlying: 13#Loop~1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [5, 0]]" "assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;" "CountingPredicate [underlying: 13#Loop~1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [4, 0]]") ("CountingPredicate [underlying: 29#L40-3true, annotation: [5, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 13#Loop~1true, annotation: [4, 0]]" "#t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11;" "CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]" "assume !true;" "CountingPredicate [underlying: 18#L49-3true, annotation: [8, 0]]") ("CountingPredicate [underlying: 14#L51true, annotation: [7, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [2, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 42#ERRORtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#L15-2true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [12, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [12, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [12, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [8, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [8, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [8, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 39#mainFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 37#mainEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [11, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 10#L51-2true, annotation: [11, 0]]") ("CountingPredicate [underlying: 36#L49-2true, annotation: [11, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 30#L53true, annotation: [11, 0]]") ("CountingPredicate [underlying: 19#Loop~2true, annotation: [5, 0]]" "#t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13;" "CountingPredicate [underlying: 17#L49true, annotation: [5, 0]]") ("CountingPredicate [underlying: 29#L40-3true, annotation: [4, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]") ("CountingPredicate [underlying: 22#L33true, annotation: [5, 0]]" "assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]") ("CountingPredicate [underlying: 22#L33true, annotation: [5, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;" "CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]") ("CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 25#L42true, annotation: [5, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 18#L49-3true, annotation: [5, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 28#L31-2true, annotation: [6, 0]]") ("CountingPredicate [underlying: 6#L31true, annotation: [6, 0]]" "assume !true;" "CountingPredicate [underlying: 29#L40-3true, annotation: [7, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [4, 0]]" "assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);" "CountingPredicate [underlying: 13#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 25#L42true, annotation: [4, 0]]" "assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;" "CountingPredicate [underlying: 13#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 38#L15true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 31#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [14, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 36#L49-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L49true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 30#L53true, annotation: [5, 0]]") ("CountingPredicate [underlying: 14#L51true, annotation: [8, 0]]" "havoc #t~mem12;" "CountingPredicate [underlying: 19#Loop~2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 20#L15-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 18#L49-3true, annotation: [4, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 17#L49true, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]" "assume !true;" "CountingPredicate [underlying: 18#L49-3true, annotation: [7, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 38#L15true, annotation: [7, 0]]") ("CountingPredicate [underlying: 42#ERRORtrue, annotation: [7, 0]]" "assume !false;" "CountingPredicate [underlying: 21#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 30#L53true, annotation: [5, 0]]" "#res := 1;" "CountingPredicate [underlying: 39#mainFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 10#L51-2true, annotation: [8, 0]]" "call #t~mem12 := read~int#2(~b~0.base, ~b~0.offset + 8 * ~i~0, 8);" "CountingPredicate [underlying: 7#L51-1true, annotation: [8, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [8, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [8, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [7, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [7, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [2, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 11#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 24#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#56#return;" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [12, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [12, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [11, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [12, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [4, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [4, 0]]") ("CountingPredicate [underlying: 35#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "#52#return;" "CountingPredicate [underlying: 5#L25true, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 35#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "#52#return;" "CountingPredicate [underlying: 5#L25true, annotation: [4, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [14, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [14, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [12, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [14, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [11, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [14, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 37#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 41#ULTIMATE.startFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 34#__VERIFIER_assertEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 7#L51-1true, annotation: [5, 0]]" "#50#return;" "CountingPredicate [underlying: 14#L51true, annotation: [5, 0]]") } ); [2024-08-07 13:44:54,732 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 41 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-07 13:44:54,733 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,733 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,733 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,733 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,733 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,734 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,735 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,735 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,735 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,735 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,738 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,738 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,738 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,739 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,740 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,741 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,741 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,741 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,741 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,741 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,743 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,744 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,744 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,744 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,744 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,744 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,744 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,745 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,745 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,745 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,745 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,745 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,745 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,746 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,746 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,746 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,746 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,746 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,746 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,747 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,748 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,748 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,748 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,748 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,749 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,750 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,750 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,750 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,750 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,750 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,751 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,751 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,751 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,751 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,752 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,753 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,753 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,754 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,755 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,756 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,757 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,758 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,758 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,758 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,758 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,758 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,758 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,760 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,760 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,760 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,760 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,760 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,761 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,761 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,761 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,761 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,761 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,761 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,762 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,763 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,763 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,764 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,765 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,766 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,766 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,766 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,766 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,766 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,767 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,768 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,769 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,770 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,771 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,772 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,773 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,774 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,775 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,775 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,775 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,775 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,775 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,775 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,776 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,776 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,776 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,776 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,776 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,776 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,777 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,778 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,779 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,780 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,781 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,782 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,783 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,783 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,783 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,783 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,783 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,784 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,784 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,784 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,784 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,785 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,786 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,787 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,796 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,797 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,797 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,797 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,797 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,797 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,797 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,798 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,799 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,800 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,801 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(10, ~a~0.base, ~a~0.offset, 8);, isNegated false [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#1(10 + #t~mem7, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem7;, isNegated true [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,802 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,803 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,804 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,804 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,804 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,804 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,804 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,804 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,805 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,805 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,805 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,805 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,806 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,807 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,807 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,807 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,807 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,807 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,807 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,808 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,808 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:54,808 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:54,808 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:54,808 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:54,809 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,809 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,809 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(1, ~b~0.base, ~b~0.offset, 8);, isNegated false [2024-08-07 13:44:54,809 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem9 := read~int#2(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem10 := read~int#1(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int#2(#t~mem9 + #t~mem10, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem9;havoc #t~mem10;, isNegated true [2024-08-07 13:44:54,810 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,810 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,810 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,810 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,810 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,810 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,811 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,811 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,813 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:54,814 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:54,823 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 202 states to 61 states. [2024-08-07 13:44:54,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 13:44:54,847 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=false, 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;@557904c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 13:44:54,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 13:44:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2024-08-07 13:44:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-08-07 13:44:54,853 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:44:54,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 13:44:54,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:44:54,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:44:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash -64312948, now seen corresponding path program 1 times [2024-08-07 13:44:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:44:54,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595247582] [2024-08-07 13:44:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:44:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:44:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:44:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-07 13:44:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595247582] [2024-08-07 13:44:55,015 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-08-07 13:44:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731103184] [2024-08-07 13:44:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:44:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-07 13:44:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 13:44:55,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-07 13:44:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-07 13:44:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:44:55,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-07 13:44:55,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-07 13:44:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-07 13:44:55,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-07 13:44:55,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731103184] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-07 13:44:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-07 13:44:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-07 13:44:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198388059] [2024-08-07 13:44:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-07 13:44:55,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-07 13:44:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-07 13:44:55,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-07 13:44:55,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-07 13:44:55,156 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-07 13:44:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-07 13:44:55,165 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-08-07 13:44:55,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-07 13:44:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-08-07 13:44:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-07 13:44:55,169 INFO L225 Difference]: With dead ends: 49 [2024-08-07 13:44:55,169 INFO L226 Difference]: Without dead ends: 49 [2024-08-07 13:44:55,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-07 13:44:55,175 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-07 13:44:55,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-07 13:44:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-08-07 13:44:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-08-07 13:44:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-07 13:44:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-08-07 13:44:55,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 32 [2024-08-07 13:44:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-07 13:44:55,205 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-08-07 13:44:55,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-07 13:44:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-08-07 13:44:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-08-07 13:44:55,206 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:44:55,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 13:44:55,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-07 13:44:55,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-08-07 13:44:55,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:44:55,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:44:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1427325344, now seen corresponding path program 1 times [2024-08-07 13:44:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:44:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533935340] [2024-08-07 13:44:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:44:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:44:55,449 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-08-07 13:44:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005426139] [2024-08-07 13:44:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:44:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-07 13:44:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 13:44:55,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-07 13:44:55,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-07 13:44:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:44:55,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 13:44:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:44:55,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 13:44:55,573 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 13:44:55,574 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 13:44:55,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-07 13:44:55,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-08-07 13:44:55,788 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-07 13:44:55,791 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 13:44:55,802 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,802 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,803 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,803 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,803 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,803 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,804 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,804 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,804 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,804 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:55,808 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-08-07 13:44:55,813 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 01:44:55 BoogieIcfgContainer [2024-08-07 13:44:55,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 13:44:55,815 INFO L158 Benchmark]: Toolchain (without parser) took 1899.30ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 38.6MB in the beginning and 75.7MB in the end (delta: -37.1MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-08-07 13:44:55,815 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:44:55,815 INFO L158 Benchmark]: Witness Parser took 0.08ms. Allocated memory is still 79.7MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:44:55,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.73ms. Allocated memory is still 79.7MB. Free memory was 38.3MB in the beginning and 50.1MB in the end (delta: -11.8MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-08-07 13:44:55,816 INFO L158 Benchmark]: Boogie Preprocessor took 38.68ms. Allocated memory is still 79.7MB. Free memory was 50.1MB in the beginning and 48.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 13:44:55,818 INFO L158 Benchmark]: IcfgBuilder took 327.56ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 48.0MB in the beginning and 78.5MB in the end (delta: -30.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-07 13:44:55,818 INFO L158 Benchmark]: TraceAbstraction took 1320.54ms. Allocated memory is still 100.7MB. Free memory was 78.0MB in the beginning and 75.7MB in the end (delta: 2.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-08-07 13:44:55,819 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.19ms. Allocated memory is still 79.7MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.08ms. Allocated memory is still 79.7MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.73ms. Allocated memory is still 79.7MB. Free memory was 38.3MB in the beginning and 50.1MB in the end (delta: -11.8MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.68ms. Allocated memory is still 79.7MB. Free memory was 50.1MB in the beginning and 48.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 327.56ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 48.0MB in the beginning and 78.5MB in the end (delta: -30.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1320.54ms. Allocated memory is still 100.7MB. Free memory was 78.0MB in the beginning and 75.7MB in the end (delta: 2.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0, \old(N)=6] [L23] N = __VERIFIER_nondet_int() [L24] N <= 0 VAL [N=1, \old(N)=0] [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [N=1, \old(N)=0, \old(cond)=1] [L13] !cond VAL [N=1, \old(N)=0, \old(cond)=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [N=1, \old(N)=0] [L27] int i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L31] i=0 VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=0] [L33] i==0 [L34] a[0] = 10 VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=0] [L31] i++ VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=1] [L40] i=0 VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=0] [L42] i==0 [L43] b[0] = 1 VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=0] [L40] i++ VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=1] [L49] i=0 VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=0] [L51] EXPR b[i] VAL [N=1, \old(N)=0, a={4:0}, b={-1:0}, i=0] [L51] CALL __VERIFIER_assert(b[i] == 5*i*i + 5*i + 5) VAL [N=1, \old(N)=0, \old(cond)=0] [L15] !(cond) VAL [N=1, \old(N)=0, \old(cond)=0] [L15] reach_error() VAL [N=1, \old(N)=0, \old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 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 proved your program to be incorrect! [2024-08-07 13:44:55,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE