/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 13:27:28,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 13:27:28,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 13:27:28,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 13:27:28,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 13:27:28,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 13:27:28,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 13:27:28,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 13:27:28,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 13:27:28,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 13:27:28,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 13:27:28,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 13:27:28,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 13:27:28,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 13:27:28,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 13:27:28,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 13:27:28,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 13:27:28,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 13:27:28,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 13:27:28,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 13:27:28,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 13:27:28,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 13:27:28,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 13:27:28,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 13:27:28,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 13:27:28,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 13:27:28,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 13:27:28,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 13:27:28,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 13:27:28,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 13:27:28,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 13:27:28,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 13:27:28,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 13:27:28,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 13:27:28,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 13:27:28,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 13:27:28,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 13:27:28,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 13:27:28,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 13:27:28,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 13:27:28,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 13:27:28,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-09-16 13:27:28,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 13:27:28,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 13:27:28,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 13:27:28,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 13:27:28,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 13:27:28,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 13:27:28,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 13:27:28,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 13:27:28,348 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 13:27:28,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 13:27:28,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 13:27:28,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 13:27:28,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 13:27:28,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 13:27:28,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 13:27:28,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 13:27:28,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 13:27:28,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 13:27:28,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:27:28,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 13:27:28,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 13:27:28,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 13:27:28,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 13:27:28,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 13:27:28,353 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 13:27:28,353 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-16 13:27:28,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 13:27:28,353 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-09-16 13:27:28,353 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-09-16 13:27:28,353 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.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 13:27:28,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 13:27:28,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 13:27:28,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 13:27:28,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 13:27:28,631 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 13:27:28,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-09-16 13:27:28,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff4ef709/880469157f2f47db969a7f48246bcf4d/FLAGe5ff8b4b1 [2022-09-16 13:27:29,180 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 13:27:29,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-09-16 13:27:29,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff4ef709/880469157f2f47db969a7f48246bcf4d/FLAGe5ff8b4b1 [2022-09-16 13:27:29,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff4ef709/880469157f2f47db969a7f48246bcf4d [2022-09-16 13:27:29,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 13:27:29,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 13:27:29,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 13:27:29,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 13:27:29,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 13:27:29,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:29,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18bff51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29, skipping insertion in model container [2022-09-16 13:27:29,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:29,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 13:27:29,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 13:27:29,889 WARN L230 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-sum2.wvr.c[2599,2612] [2022-09-16 13:27:29,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:27:29,903 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 13:27:29,919 WARN L230 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-sum2.wvr.c[2599,2612] [2022-09-16 13:27:29,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:27:29,932 INFO L208 MainTranslator]: Completed translation [2022-09-16 13:27:29,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29 WrapperNode [2022-09-16 13:27:29,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 13:27:29,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 13:27:29,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 13:27:29,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 13:27:29,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:29,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,006 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 365 [2022-09-16 13:27:30,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 13:27:30,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 13:27:30,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 13:27:30,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 13:27:30,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 13:27:30,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 13:27:30,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 13:27:30,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 13:27:30,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (1/1) ... [2022-09-16 13:27:30,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:27:30,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:30,092 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) [2022-09-16 13:27:30,097 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 [2022-09-16 13:27:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 13:27:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 13:27:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 13:27:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 13:27:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 13:27:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 13:27:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 13:27:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 13:27:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 13:27:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 13:27:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 13:27:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 13:27:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 13:27:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 13:27:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 13:27:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 13:27:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 13:27:30,129 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 13:27:30,258 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 13:27:30,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 13:27:30,869 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 13:27:31,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 13:27:31,894 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-09-16 13:27:31,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:27:31 BoogieIcfgContainer [2022-09-16 13:27:31,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 13:27:31,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 13:27:31,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 13:27:31,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 13:27:31,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 01:27:29" (1/3) ... [2022-09-16 13:27:31,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6138b322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:27:31, skipping insertion in model container [2022-09-16 13:27:31,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:27:29" (2/3) ... [2022-09-16 13:27:31,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6138b322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:27:31, skipping insertion in model container [2022-09-16 13:27:31,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:27:31" (3/3) ... [2022-09-16 13:27:31,906 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2022-09-16 13:27:31,914 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 13:27:31,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 13:27:31,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-09-16 13:27:31,923 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 13:27:32,320 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-16 13:27:32,378 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:27:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-16 13:27:32,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:32,382 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) [2022-09-16 13:27:32,384 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 [2022-09-16 13:27:32,418 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-16 13:27:32,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread2Thread1of1ForFork1 ======== [2022-09-16 13:27:32,443 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;@5bf77b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:27:32,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-09-16 13:27:32,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-09-16 13:27:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash -995941751, now seen corresponding path program 1 times [2022-09-16 13:27:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:32,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11063155] [2022-09-16 13:27:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:32,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:27:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:33,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11063155] [2022-09-16 13:27:33,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11063155] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:27:33,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:27:33,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:27:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935140747] [2022-09-16 13:27:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:27:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-16 13:27:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:27:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-16 13:27:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-16 13:27:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:33,043 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:27:33,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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) [2022-09-16 13:27:33,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:33,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 13:27:33,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-09-16 13:27:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1962345758, now seen corresponding path program 1 times [2022-09-16 13:27:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:33,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111775608] [2022-09-16 13:27:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:27:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:33,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111775608] [2022-09-16 13:27:33,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111775608] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:27:33,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:27:33,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 13:27:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306082323] [2022-09-16 13:27:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:27:33,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 13:27:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:27:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 13:27:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-09-16 13:27:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:33,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:27:33,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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) [2022-09-16 13:27:33,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:33,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:34,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 13:27:34,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-09-16 13:27:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash -804909651, now seen corresponding path program 1 times [2022-09-16 13:27:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:34,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076149463] [2022-09-16 13:27:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 13:27:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076149463] [2022-09-16 13:27:34,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076149463] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:27:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631587693] [2022-09-16 13:27:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:34,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:27:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:34,324 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) [2022-09-16 13:27:34,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-16 13:27:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:34,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2022-09-16 13:27:34,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:27:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 13:27:34,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:27:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 13:27:35,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631587693] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:27:35,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:27:35,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2022-09-16 13:27:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131774160] [2022-09-16 13:27:35,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:27:35,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 13:27:35,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:27:35,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 13:27:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-09-16 13:27:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:35,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:27:35,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.12) internal successors, (178), 25 states have internal predecessors, (178), 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) [2022-09-16 13:27:35,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:35,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:35,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-09-16 13:27:36,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-16 13:27:36,783 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 [2022-09-16 13:27:36,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-09-16 13:27:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 464723778, now seen corresponding path program 2 times [2022-09-16 13:27:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:36,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560655997] [2022-09-16 13:27:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:27:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:37,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560655997] [2022-09-16 13:27:37,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560655997] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:27:37,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558430344] [2022-09-16 13:27:37,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:27:37,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:27:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:37,217 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) [2022-09-16 13:27:37,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-16 13:27:37,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:27:37,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:27:37,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 13:27:37,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:27:37,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:27:38,097 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 13:27:38,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 13:27:38,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:38,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:27:38,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:38,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:27:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:27:38,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:27:38,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2022-09-16 13:27:38,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2022-09-16 13:27:38,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|) 9223372039002259456))) is different from false [2022-09-16 13:27:38,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 13:27:38,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 13:27:38,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_111 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 13:27:38,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22|)) (forall ((v_ArrVal_111 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) is different from false [2022-09-16 13:27:38,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_111 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 13:27:38,710 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:27:38,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-09-16 13:27:38,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:38,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-09-16 13:27:38,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2022-09-16 13:27:38,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-09-16 13:27:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2022-09-16 13:27:39,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558430344] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:27:39,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:27:39,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 13:27:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056020508] [2022-09-16 13:27:39,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:27:39,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 13:27:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:27:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 13:27:39,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1414, Unknown=8, NotChecked=664, Total=2256 [2022-09-16 13:27:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:39,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:27:39,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.0212765957446805) internal successors, (283), 48 states have internal predecessors, (283), 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) [2022-09-16 13:27:39,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:39,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:39,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-09-16 13:27:39,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:40,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1| 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_111 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 13:27:40,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_111 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 13:27:42,545 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1| 0) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22|)) (forall ((v_ArrVal_111 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_22| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 13:27:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-09-16 13:27:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:44,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-16 13:27:44,376 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 [2022-09-16 13:27:44,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-09-16 13:27:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 464723781, now seen corresponding path program 1 times [2022-09-16 13:27:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:44,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975181804] [2022-09-16 13:27:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:27:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:44,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975181804] [2022-09-16 13:27:44,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975181804] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:27:44,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683634353] [2022-09-16 13:27:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:44,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:27:44,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:44,830 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) [2022-09-16 13:27:44,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 13:27:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:45,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 38 conjunts are in the unsatisfiable core [2022-09-16 13:27:45,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:27:45,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:27:45,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:45,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 13:27:45,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:45,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:27:45,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:45,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:27:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:27:46,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:27:46,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) c_~B~0.base) c_~B~0.offset) 4294967295)) is different from false [2022-09-16 13:27:46,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) c_~B~0.base) c_~B~0.offset) 4294967295)) is different from false [2022-09-16 13:27:46,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|) 4294967295)) is different from false [2022-09-16 13:27:46,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 13:27:46,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 13:27:46,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_161 Int) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_161)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 13:27:46,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| Int)) (or (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_161 Int) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_161)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30|)))) is different from false [2022-09-16 13:27:46,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_161 Int) (v_ArrVal_163 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_161)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) is different from false [2022-09-16 13:27:46,253 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:27:46,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-09-16 13:27:46,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:46,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2022-09-16 13:27:46,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-09-16 13:27:46,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-09-16 13:27:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2022-09-16 13:27:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683634353] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:27:46,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:27:46,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2022-09-16 13:27:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652190333] [2022-09-16 13:27:46,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:27:46,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-09-16 13:27:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:27:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-09-16 13:27:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1322, Unknown=8, NotChecked=648, Total=2162 [2022-09-16 13:27:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:46,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:27:46,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 6.130434782608695) internal successors, (282), 47 states have internal predecessors, (282), 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) [2022-09-16 13:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-09-16 13:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:47,682 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1| 2147483647) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_161 Int) (v_ArrVal_163 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_161)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))))) is different from false [2022-09-16 13:27:48,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_161 Int) (v_ArrVal_163 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_161)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))))) is different from false [2022-09-16 13:27:50,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| Int)) (or (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_161 Int) (v_ArrVal_163 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_161)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_30|)))) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1| 0) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post30#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 13:27:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-16 13:27:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-09-16 13:27:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:51,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 13:27:51,233 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 [2022-09-16 13:27:51,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-09-16 13:27:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash 464723782, now seen corresponding path program 1 times [2022-09-16 13:27:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:51,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329203620] [2022-09-16 13:27:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 13:27:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:52,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329203620] [2022-09-16 13:27:52,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329203620] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:27:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119409921] [2022-09-16 13:27:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:27:52,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:52,300 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) [2022-09-16 13:27:52,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 13:27:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:52,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-09-16 13:27:52,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:27:52,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 13:27:52,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:27:53,131 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 13:27:53,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 13:27:53,456 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:27:53,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 13:27:53,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:27:53,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:27:53,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:53,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:27:53,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:53,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:27:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 13:27:53,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:27:56,171 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse0 (select (select .cse1 ~B~0.base) ~B~0.offset))) (or (< .cse0 0) (<= (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) .cse0) 2147483647) (< 0 .cse0))))) (forall ((v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< (+ 9223372039002259455 .cse2) 0) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647) (<= 0 .cse2)))))) is different from false [2022-09-16 13:27:56,288 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse0 (select (select .cse1 ~B~0.base) ~B~0.offset))) (or (< (+ 9223372039002259455 .cse0) 0) (<= (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) .cse0) 2147483647) (<= 0 .cse0))))) (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< 0 .cse2) (< .cse2 0) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647)))))) is different from false [2022-09-16 13:27:56,720 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse1 (select (select .cse0 ~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) .cse1) 2147483647) (<= 0 .cse1) (< (+ 9223372039002259455 .cse1) 0))))) (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< .cse2 0) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647) (< 0 .cse2)))))) is different from false [2022-09-16 13:27:56,967 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse0 (select (select .cse1 ~B~0.base) ~B~0.offset))) (or (<= (+ .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)) 2147483647) (< (+ 9223372039002259455 .cse0) 0) (<= 0 .cse0))))) (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< .cse2 0) (<= (+ .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) 2147483647) (< 0 .cse2)))))) is different from false [2022-09-16 13:28:26,599 INFO L356 Elim1Store]: treesize reduction 40, result has 62.6 percent of original size [2022-09-16 13:28:26,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 305 treesize of output 229 [2022-09-16 13:28:26,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:26,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32725 treesize of output 31558 [2022-09-16 13:28:26,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:26,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31471 treesize of output 30392 [2022-09-16 13:28:27,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:27,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30383 treesize of output 30120 [2022-09-16 13:28:27,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:27,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30111 treesize of output 29576 [2022-09-16 13:28:27,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:27,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29587 treesize of output 29411 [2022-09-16 13:28:27,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:27,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29367 treesize of output 28832 [2022-09-16 13:28:27,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:27,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28823 treesize of output 27744 [2022-09-16 13:28:28,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:28:28,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27735 treesize of output 25568 Received shutdown request... [2022-09-16 13:40:36,155 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-16 13:40:36,157 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-09-16 13:40:36,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 13:40:36,187 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 13:40:36,192 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 13:40:36,202 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 13:40:36,357 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 [2022-09-16 13:40:36,358 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. [2022-09-16 13:40:36,359 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-09-16 13:40:36,360 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-09-16 13:40:36,361 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-09-16 13:40:36,361 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-09-16 13:40:36,361 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-09-16 13:40:36,361 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-09-16 13:40:36,365 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-09-16 13:40:36,366 INFO L307 ceAbstractionStarter]: Result for error location thread2Thread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/4) [2022-09-16 13:40:36,368 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 13:40:36,368 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 13:40:36,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 01:40:36 BasicIcfg [2022-09-16 13:40:36,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 13:40:36,375 INFO L158 Benchmark]: Toolchain (without parser) took 786678.93ms. Allocated memory was 273.7MB in the beginning and 783.3MB in the end (delta: 509.6MB). Free memory was 246.0MB in the beginning and 505.0MB in the end (delta: -259.0MB). Peak memory consumption was 530.8MB. Max. memory is 8.0GB. [2022-09-16 13:40:36,375 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 13:40:36,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.85ms. Allocated memory is still 273.7MB. Free memory was 245.5MB in the beginning and 241.4MB in the end (delta: 4.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-09-16 13:40:36,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.74ms. Allocated memory is still 273.7MB. Free memory was 241.4MB in the beginning and 238.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 13:40:36,376 INFO L158 Benchmark]: Boogie Preprocessor took 49.62ms. Allocated memory is still 273.7MB. Free memory was 238.2MB in the beginning and 236.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 13:40:36,376 INFO L158 Benchmark]: RCFGBuilder took 1839.66ms. Allocated memory is still 273.7MB. Free memory was 236.1MB in the beginning and 102.8MB in the end (delta: 133.3MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. [2022-09-16 13:40:36,380 INFO L158 Benchmark]: TraceAbstraction took 784471.73ms. Allocated memory was 273.7MB in the beginning and 783.3MB in the end (delta: 509.6MB). Free memory was 102.3MB in the beginning and 505.0MB in the end (delta: -402.7MB). Peak memory consumption was 387.1MB. Max. memory is 8.0GB. [2022-09-16 13:40:36,381 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.13ms. Allocated memory is still 183.5MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.85ms. Allocated memory is still 273.7MB. Free memory was 245.5MB in the beginning and 241.4MB in the end (delta: 4.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.74ms. Allocated memory is still 273.7MB. Free memory was 241.4MB in the beginning and 238.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.62ms. Allocated memory is still 273.7MB. Free memory was 238.2MB in the beginning and 236.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1839.66ms. Allocated memory is still 273.7MB. Free memory was 236.1MB in the beginning and 102.8MB in the end (delta: 133.3MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. * TraceAbstraction took 784471.73ms. Allocated memory was 273.7MB in the beginning and 783.3MB in the end (delta: 509.6MB). Free memory was 102.3MB in the beginning and 505.0MB in the end (delta: -402.7MB). Peak memory consumption was 387.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6379, positive: 4269, positive conditional: 1022, positive unconditional: 3247, negative: 2110, negative conditional: 2103, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4388, positive: 4269, positive conditional: 1022, positive unconditional: 3247, negative: 119, negative conditional: 112, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4388, positive: 4269, positive conditional: 1022, positive unconditional: 3247, negative: 119, negative conditional: 112, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4710, positive: 4269, positive conditional: 0, positive unconditional: 4269, negative: 441, negative conditional: 322, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4710, positive: 4269, positive conditional: 0, positive unconditional: 4269, negative: 441, negative conditional: 105, negative unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4710, positive: 4269, positive conditional: 0, positive unconditional: 4269, negative: 441, negative conditional: 105, negative unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3145, positive: 3104, positive conditional: 0, positive unconditional: 3104, negative: 41, negative conditional: 28, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3145, positive: 3092, positive conditional: 0, positive unconditional: 3092, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 41, negative conditional: 28, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 904, positive: 256, positive conditional: 0, positive unconditional: 256, negative: 648, negative conditional: 461, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4710, positive: 1165, positive conditional: 0, positive unconditional: 1165, negative: 400, negative conditional: 77, negative unconditional: 323, unknown: 3145, unknown conditional: 28, unknown unconditional: 3117] , Statistics on independence cache: Total cache size (in pairs): 3145, Positive cache size: 3104, Positive conditional cache size: 0, Positive unconditional cache size: 3104, Negative cache size: 41, Negative conditional cache size: 28, Negative unconditional cache size: 13, Eliminated conditions: 217, Maximal queried relation: 4, Independence queries for same thread: 1991 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 158, Number of trivial persistent sets: 134, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3254, positive: 3247, positive conditional: 0, positive unconditional: 3247, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6379, positive: 4269, positive conditional: 1022, positive unconditional: 3247, negative: 2110, negative conditional: 2103, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4388, positive: 4269, positive conditional: 1022, positive unconditional: 3247, negative: 119, negative conditional: 112, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4388, positive: 4269, positive conditional: 1022, positive unconditional: 3247, negative: 119, negative conditional: 112, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4710, positive: 4269, positive conditional: 0, positive unconditional: 4269, negative: 441, negative conditional: 322, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4710, positive: 4269, positive conditional: 0, positive unconditional: 4269, negative: 441, negative conditional: 105, negative unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4710, positive: 4269, positive conditional: 0, positive unconditional: 4269, negative: 441, negative conditional: 105, negative unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3145, positive: 3104, positive conditional: 0, positive unconditional: 3104, negative: 41, negative conditional: 28, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3145, positive: 3092, positive conditional: 0, positive unconditional: 3092, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 41, negative conditional: 28, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 904, positive: 256, positive conditional: 0, positive unconditional: 256, negative: 648, negative conditional: 461, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4710, positive: 1165, positive conditional: 0, positive unconditional: 1165, negative: 400, negative conditional: 77, negative unconditional: 323, unknown: 3145, unknown conditional: 28, unknown unconditional: 3117] , Statistics on independence cache: Total cache size (in pairs): 3145, Positive cache size: 3104, Positive conditional cache size: 0, Positive unconditional cache size: 3104, Negative cache size: 41, Negative conditional cache size: 28, Negative unconditional cache size: 13, Eliminated conditions: 217, Maximal queried relation: 4, Independence queries for same thread: 1991 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 9ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread2Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 311 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 784.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 11.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1364 ConstructedInterpolants, 72 QuantifiedInterpolants, 11519 SizeOfPredicates, 45 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 69/138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown