/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 13:42:00,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 13:42:00,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 13:42:00,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 13:42:00,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 13:42:00,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 13:42:00,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 13:42:00,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 13:42:00,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 13:42:00,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 13:42:00,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 13:42:00,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 13:42:00,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 13:42:00,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 13:42:00,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 13:42:00,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 13:42:00,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 13:42:00,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 13:42:00,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 13:42:00,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 13:42:00,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 13:42:00,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 13:42:00,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 13:42:00,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 13:42:00,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 13:42:00,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 13:42:00,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 13:42:00,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 13:42:00,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 13:42:00,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 13:42:00,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 13:42:00,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 13:42:00,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 13:42:00,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 13:42:00,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 13:42:00,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 13:42:00,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 13:42:00,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 13:42:00,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 13:42:00,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 13:42:00,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 13:42:00,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-01-10 13:42:00,891 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 13:42:00,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 13:42:00,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 13:42:00,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 13:42:00,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 13:42:00,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 13:42:00,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 13:42:00,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 13:42:00,892 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 13:42:00,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 13:42:00,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 13:42:00,897 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 13:42:00,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 13:42:00,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 13:42:00,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 13:42:00,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 13:42:00,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 13:42:00,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 13:42:00,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 13:42:00,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 13:42:01,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 13:42:01,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 13:42:01,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 13:42:01,070 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 13:42:01,070 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 13:42:01,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-01-10 13:42:02,004 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 13:42:02,124 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 13:42:02,125 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-01-10 13:42:02,130 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eed07106/8cb1da7072d2414b8d69d687188c0302/FLAG33565eec2 [2023-01-10 13:42:02,144 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eed07106/8cb1da7072d2414b8d69d687188c0302 [2023-01-10 13:42:02,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 13:42:02,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 13:42:02,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 13:42:02,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 13:42:02,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 13:42:02,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56538709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02, skipping insertion in model container [2023-01-10 13:42:02,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 13:42:02,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 13:42:02,317 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-01-10 13:42:02,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 13:42:02,329 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 13:42:02,343 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-01-10 13:42:02,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 13:42:02,351 WARN L663 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 13:42:02,351 WARN L663 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 13:42:02,355 INFO L208 MainTranslator]: Completed translation [2023-01-10 13:42:02,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02 WrapperNode [2023-01-10 13:42:02,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 13:42:02,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 13:42:02,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 13:42:02,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 13:42:02,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,399 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 284 [2023-01-10 13:42:02,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 13:42:02,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 13:42:02,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 13:42:02,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 13:42:02,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,425 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 13:42:02,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 13:42:02,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 13:42:02,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 13:42:02,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (1/1) ... [2023-01-10 13:42:02,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 13:42:02,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:42:02,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-10 13:42:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-10 13:42:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 13:42:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 13:42:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 13:42:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 13:42:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-10 13:42:02,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-10 13:42:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-10 13:42:02,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-10 13:42:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-10 13:42:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-10 13:42:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 13:42:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-10 13:42:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-10 13:42:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-10 13:42:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 13:42:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 13:42:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 13:42:02,495 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 13:42:02,597 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 13:42:02,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 13:42:02,912 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 13:42:03,182 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 13:42:03,183 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-10 13:42:03,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:03 BoogieIcfgContainer [2023-01-10 13:42:03,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 13:42:03,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 13:42:03,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 13:42:03,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 13:42:03,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:42:02" (1/3) ... [2023-01-10 13:42:03,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bfb003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:03, skipping insertion in model container [2023-01-10 13:42:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:02" (2/3) ... [2023-01-10 13:42:03,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bfb003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:03, skipping insertion in model container [2023-01-10 13:42:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:03" (3/3) ... [2023-01-10 13:42:03,191 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-01-10 13:42:03,196 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 13:42:03,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 13:42:03,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-10 13:42:03,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 13:42:03,272 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-10 13:42:03,302 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:42:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:42:03,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:42:03,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 13:42:03,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-01-10 13:42:03,325 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:42:03,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 13:42:03,333 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@24c51b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:42:03,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:42:03,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash 383211199, now seen corresponding path program 1 times [2023-01-10 13:42:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490311725] [2023-01-10 13:42:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 13:42:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:42:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490311725] [2023-01-10 13:42:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490311725] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:42:03,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:42:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 13:42:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347221533] [2023-01-10 13:42:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:42:03,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 13:42:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:42:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 13:42:03,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 13:42:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:03,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:42:03,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:42:03,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:03,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 13:42:03,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1114029442, now seen corresponding path program 1 times [2023-01-10 13:42:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423820117] [2023-01-10 13:42:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-10 13:42:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:42:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423820117] [2023-01-10 13:42:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423820117] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:42:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:42:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-10 13:42:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471103571] [2023-01-10 13:42:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:42:04,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-10 13:42:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:42:04,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-10 13:42:04,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-01-10 13:42:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:04,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:42:04,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:42:04,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:04,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:04,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-10 13:42:04,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash -66297984, now seen corresponding path program 1 times [2023-01-10 13:42:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:04,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725168162] [2023-01-10 13:42:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 13:42:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:42:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725168162] [2023-01-10 13:42:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725168162] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:42:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911615038] [2023-01-10 13:42:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:04,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:42:04,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 13:42:04,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-10 13:42:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:04,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-10 13:42:04,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:42:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 13:42:04,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:42:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 13:42:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911615038] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-10 13:42:05,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-10 13:42:05,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-01-10 13:42:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438664127] [2023-01-10 13:42:05,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:42:05,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-10 13:42:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:42:05,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-10 13:42:05,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-01-10 13:42:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:05,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:42:05,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:42:05,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:05,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:05,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:05,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-10 13:42:05,377 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,SelfDestructingSolverStorable2 [2023-01-10 13:42:05,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:05,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1223986022, now seen corresponding path program 1 times [2023-01-10 13:42:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042933814] [2023-01-10 13:42:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-10 13:42:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:42:05,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042933814] [2023-01-10 13:42:05,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042933814] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:42:05,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590269988] [2023-01-10 13:42:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:05,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:42:05,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 13:42:05,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-10 13:42:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:05,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-10 13:42:05,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:42:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-10 13:42:05,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:42:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-10 13:42:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590269988] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:42:06,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:42:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-01-10 13:42:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646980344] [2023-01-10 13:42:06,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:42:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-10 13:42:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:42:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-10 13:42:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-01-10 13:42:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:06,080 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:42:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.04) internal successors, (201), 25 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:42:06,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:06,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:06,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:06,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 13:42:06,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-10 13:42:06,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:06,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:06,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash -967087080, now seen corresponding path program 2 times [2023-01-10 13:42:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473139027] [2023-01-10 13:42:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:06,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-01-10 13:42:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:42:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473139027] [2023-01-10 13:42:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473139027] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:42:06,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866421073] [2023-01-10 13:42:06,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:42:06,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:42:06,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 13:42:06,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-10 13:42:07,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:42:07,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:42:07,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-10 13:42:07,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:42:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-01-10 13:42:07,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:42:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-01-10 13:42:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866421073] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:42:07,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:42:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-01-10 13:42:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28649854] [2023-01-10 13:42:07,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:42:07,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-10 13:42:07,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:42:07,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-10 13:42:07,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-01-10 13:42:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:07,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:42:07,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.714285714285714) internal successors, (267), 21 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:42:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-01-10 13:42:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:42:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:42:07,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-10 13:42:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:08,154 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2106896178, now seen corresponding path program 3 times [2023-01-10 13:42:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925188960] [2023-01-10 13:42:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:08,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:42:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-01-10 13:42:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:42:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925188960] [2023-01-10 13:42:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925188960] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:42:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480552775] [2023-01-10 13:42:08,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 13:42:08,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:08,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:42:08,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 13:42:08,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-10 13:42:08,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-10 13:42:08,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:42:08,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 13:42:08,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:42:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-01-10 13:42:08,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:42:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-01-10 13:42:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480552775] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:42:08,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:42:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 29 [2023-01-10 13:42:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973615489] [2023-01-10 13:42:08,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:42:08,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-10 13:42:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:42:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-10 13:42:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2023-01-10 13:42:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:08,995 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:42:08,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.793103448275861) internal successors, (284), 29 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:42:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:42:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:42:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:42:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 13:42:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:42:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:42:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-10 13:42:10,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-10 13:42:10,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:42:10,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:42:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:42:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -443896502, now seen corresponding path program 4 times [2023-01-10 13:42:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:42:10,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433179615] [2023-01-10 13:42:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:42:10,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:42:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-10 13:42:10,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-10 13:42:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-10 13:42:10,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-10 13:42:10,688 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-10 13:42:10,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 13:42:10,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-10 13:42:10,707 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-01-10 13:42:10,708 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/4) [2023-01-10 13:42:10,710 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 13:42:10,710 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 13:42:10,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:42:10 BasicIcfg [2023-01-10 13:42:10,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 13:42:10,842 INFO L158 Benchmark]: Toolchain (without parser) took 8695.05ms. Allocated memory was 316.7MB in the beginning and 400.6MB in the end (delta: 83.9MB). Free memory was 262.4MB in the beginning and 333.8MB in the end (delta: -71.4MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. [2023-01-10 13:42:10,842 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 201.3MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 13:42:10,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.65ms. Allocated memory is still 316.7MB. Free memory was 261.9MB in the beginning and 250.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-01-10 13:42:10,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 316.7MB. Free memory was 250.2MB in the beginning and 247.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-01-10 13:42:10,843 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 316.7MB. Free memory was 247.7MB in the beginning and 245.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 13:42:10,843 INFO L158 Benchmark]: RCFGBuilder took 755.39ms. Allocated memory is still 316.7MB. Free memory was 245.6MB in the beginning and 260.5MB in the end (delta: -14.9MB). Peak memory consumption was 45.9MB. Max. memory is 8.0GB. [2023-01-10 13:42:10,843 INFO L158 Benchmark]: TraceAbstraction took 7656.45ms. Allocated memory was 316.7MB in the beginning and 400.6MB in the end (delta: 83.9MB). Free memory was 259.9MB in the beginning and 333.8MB in the end (delta: -73.8MB). Peak memory consumption was 214.5MB. Max. memory is 8.0GB. [2023-01-10 13:42:10,844 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 201.3MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.65ms. Allocated memory is still 316.7MB. Free memory was 261.9MB in the beginning and 250.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 316.7MB. Free memory was 250.2MB in the beginning and 247.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 316.7MB. Free memory was 247.7MB in the beginning and 245.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 755.39ms. Allocated memory is still 316.7MB. Free memory was 245.6MB in the beginning and 260.5MB in the end (delta: -14.9MB). Peak memory consumption was 45.9MB. Max. memory is 8.0GB. * TraceAbstraction took 7656.45ms. Allocated memory was 316.7MB in the beginning and 400.6MB in the end (delta: 83.9MB). Free memory was 259.9MB in the beginning and 333.8MB in the end (delta: -73.8MB). Peak memory consumption was 214.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9032, independent: 7674, independent conditional: 7674, independent unconditional: 0, dependent: 1358, dependent conditional: 1358, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7787, independent: 7674, independent conditional: 7674, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7787, independent: 7674, independent conditional: 7674, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8019, independent: 7674, independent conditional: 0, independent unconditional: 7674, dependent: 345, dependent conditional: 232, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8019, independent: 7674, independent conditional: 0, independent unconditional: 7674, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8019, independent: 7674, independent conditional: 0, independent unconditional: 7674, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 279, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 279, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8019, independent: 7398, independent conditional: 0, independent unconditional: 7398, dependent: 342, dependent conditional: 0, dependent unconditional: 342, unknown: 279, unknown conditional: 0, unknown unconditional: 279] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 232, Maximal queried relation: 5, Independence queries for same thread: 1245 - StatisticsResult: Traversal Statistics Data States: 755, Transitions: 977, Traversal time: 133062148.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 53 - StatisticsResult: Traversal Statistics Data States: 755, Transitions: 983, Traversal time: 54265044.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 53 - StatisticsResult: Traversal Statistics Data States: 769, Transitions: 997, Traversal time: 138683264.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 53 - StatisticsResult: Traversal Statistics Data States: 210, Transitions: 228, Traversal time: 67921372.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 3 - StatisticsResult: Traversal Statistics Data States: 226, Transitions: 244, Traversal time: 304500589.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 3 - StatisticsResult: Traversal Statistics Data States: 684, Transitions: 870, Traversal time: 531756951.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 43 - StatisticsResult: Traversal Statistics Data States: 706, Transitions: 892, Traversal time: 687203965.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 43 - CounterExampleResult [Line: 106]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* A; VAL [A={0:0}] [L41] 0 int* B; VAL [A={0:0}, B={0:0}] [L42] 0 int res1, res2, M, N; VAL [A={0:0}, B={0:0}, M=0, N=0, res1=0, res2=0] [L87] 0 pthread_t t1, t2, t3; VAL [A={0:0}, B={0:0}, M=0, N=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L90] 0 M = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=0, __VERIFIER_nondet_int()=2, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L91] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, __VERIFIER_nondet_int()=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L92] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, malloc(sizeof(int) * (size_t)size)={3:0}, res1=0, res2=0, size=3] [L116] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=17, arr={3:0}, i=0, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=-11, arr={3:0}, i=1, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=11, arr={3:0}, i=2, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L116] COND FALSE 0 !(i < size) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L119] 0 return arr; VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, \result={3:0}, arr={3:0}, i=3, res1=0, res2=0, size=3] [L92] RET, EXPR 0 create_fresh_int_array(N) [L92] 0 A = create_fresh_int_array(N) VAL [A={3:0}, B={0:0}, M=2, N=3, create_fresh_int_array(N)={3:0}, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L93] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, malloc(sizeof(int) * (size_t)size)={-7:0}, res1=0, res2=0, size=3] [L116] 0 int i = 0; VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=0, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=0, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=-8, arr={-7:0}, i=0, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=1, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=1, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=-2, arr={-7:0}, i=1, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=2, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=2, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=-10, arr={-7:0}, i=2, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=3, res1=0, res2=0, size=3] [L116] COND FALSE 0 !(i < size) VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=3, res1=0, res2=0, size=3] [L119] 0 return arr; VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, \result={-7:0}, arr={-7:0}, i=3, res1=0, res2=0, size=3] [L93] RET, EXPR 0 create_fresh_int_array(N) [L93] 0 B = create_fresh_int_array(N) VAL [A={3:0}, B={-7:0}, M=2, N=3, create_fresh_int_array(N)={-7:0}, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L95] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={-7:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L95] RET 0 assume_abort_if_not(M >= 0 && M < N) [L98] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, B={-7:0}, M=2, N=3, pthread_create(&t1, 0, thread1, 0)=13, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L99] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, B={-7:0}, M=2, N=3, pthread_create(&t2, 0, thread2, 0)=14, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L100] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={3:0}, B={-7:0}, M=2, N=3, pthread_create(&t3, 0, thread3, 0)=15, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L101] 0 \read(t1) VAL [A={3:0}, B={-7:0}, M=2, N=3, \read(t1)=13, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L48] 1 int i=0; VAL [A={3:0}, B={-7:0}, M=2, N=3, i=0, res1=0, res2=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=0, res1=9, res2=0, tmp=9] [L48] 1 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=9, res2=0, tmp=9] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=-4, res2=0, tmp=-4] [L48] 1 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-4, res2=0, tmp=-4] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-3, res2=0, tmp=-3] [L48] 1 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=3, res1=-3, res2=0, tmp=-3] [L48] COND FALSE 1 !(i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(A[i], B[i]) [L63] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L123] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L63] 2 int tmp = plus(res2, plus(A[i], B[i])); [L74] 3 int i=M; VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-3, res2=0] [L74] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(A[i], B[i]) [L76] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L123] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L76] 3 int tmp = plus(res2, plus(A[i], B[i])); [L66] 2 res2 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=0, res1=-3, res2=9, tmp=9] [L61] 2 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=-3, res2=9, tmp=9] [L61] COND TRUE 2 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(A[i], B[i]) [L63] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L123] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L63] 2 int tmp = plus(res2, plus(A[i], B[i])); [L66] 2 res2 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=-3, res2=-12, tmp=-12] [L61] 2 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-3, res2=-12, tmp=-12] [L61] COND FALSE 2 !(i