/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-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 13:26:44,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 13:26:44,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 13:26:44,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 13:26:44,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 13:26:44,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 13:26:44,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 13:26:44,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 13:26:44,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 13:26:44,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 13:26:44,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 13:26:44,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 13:26:44,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 13:26:44,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 13:26:44,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 13:26:44,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 13:26:44,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 13:26:44,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 13:26:44,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 13:26:44,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 13:26:44,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 13:26:44,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 13:26:44,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 13:26:44,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 13:26:44,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 13:26:44,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 13:26:44,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 13:26:44,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 13:26:44,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 13:26:44,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 13:26:44,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 13:26:44,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 13:26:44,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 13:26:44,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 13:26:44,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 13:26:44,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 13:26:44,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 13:26:44,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 13:26:44,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 13:26:44,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 13:26:44,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 13:26:44,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-09-16 13:26:44,895 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 13:26:44,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 13:26:44,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 13:26:44,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 13:26:44,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 13:26:44,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 13:26:44,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 13:26:44,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 13:26:44,897 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 13:26:44,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 13:26:44,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 13:26:44,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 13:26:44,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 13:26:44,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 13:26:44,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 13:26:44,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 13:26:44,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 13:26:44,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:26:44,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 13:26:44,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 13:26:44,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 13:26:44,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 13:26:44,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 13:26:44,902 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 13:26:44,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-16 13:26:44,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 13:26:44,903 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-09-16 13:26:44,903 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-09-16 13:26:44,903 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:26:45,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 13:26:45,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 13:26:45,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 13:26:45,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 13:26:45,154 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 13:26:45,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-09-16 13:26:45,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcec49ec/9bc64bb10d0346cda5327a6c3e7da7b4/FLAGf7318b375 [2022-09-16 13:26:45,619 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 13:26:45,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-09-16 13:26:45,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcec49ec/9bc64bb10d0346cda5327a6c3e7da7b4/FLAGf7318b375 [2022-09-16 13:26:46,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcec49ec/9bc64bb10d0346cda5327a6c3e7da7b4 [2022-09-16 13:26:46,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 13:26:46,024 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 13:26:46,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 13:26:46,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 13:26:46,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 13:26:46,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c33eda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46, skipping insertion in model container [2022-09-16 13:26:46,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 13:26:46,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 13:26:46,245 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-sum.wvr.c[2835,2848] [2022-09-16 13:26:46,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:26:46,272 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 13:26:46,294 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-sum.wvr.c[2835,2848] [2022-09-16 13:26:46,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:26:46,319 INFO L208 MainTranslator]: Completed translation [2022-09-16 13:26:46,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46 WrapperNode [2022-09-16 13:26:46,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 13:26:46,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 13:26:46,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 13:26:46,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 13:26:46,326 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:26:46" (1/1) ... [2022-09-16 13:26:46,348 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:26:46" (1/1) ... [2022-09-16 13:26:46,391 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 374 [2022-09-16 13:26:46,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 13:26:46,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 13:26:46,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 13:26:46,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 13:26:46,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 13:26:46,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 13:26:46,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 13:26:46,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 13:26:46,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (1/1) ... [2022-09-16 13:26:46,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:26:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:26:46,482 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:26:46,502 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:26:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 13:26:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 13:26:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 13:26:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 13:26:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 13:26:46,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 13:26:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 13:26:46,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 13:26:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 13:26:46,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 13:26:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 13:26:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 13:26:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 13:26:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 13:26:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 13:26:46,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 13:26:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 13:26:46,534 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:26:46,690 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 13:26:46,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 13:26:47,271 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 13:26:48,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 13:26:48,736 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-09-16 13:26:48,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:26:48 BoogieIcfgContainer [2022-09-16 13:26:48,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 13:26:48,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 13:26:48,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 13:26:48,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 13:26:48,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 01:26:46" (1/3) ... [2022-09-16 13:26:48,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b5430f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:26:48, skipping insertion in model container [2022-09-16 13:26:48,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:26:46" (2/3) ... [2022-09-16 13:26:48,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b5430f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:26:48, skipping insertion in model container [2022-09-16 13:26:48,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:26:48" (3/3) ... [2022-09-16 13:26:48,749 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-09-16 13:26:48,757 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 13:26:48,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 13:26:48,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-09-16 13:26:48,766 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 13:26:49,165 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-16 13:26:49,205 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:26:49,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-16 13:26:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:26:49,211 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:26:49,227 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:26:49,256 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-16 13:26:49,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread2Thread1of1ForFork2 ======== [2022-09-16 13:26:49,274 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;@4a5b3a6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:26:49,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-09-16 13:26:49,538 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:26:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:26:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1886161156, now seen corresponding path program 1 times [2022-09-16 13:26:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:26:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640589434] [2022-09-16 13:26:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:26:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:26:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:26:49,714 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:26:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:26:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640589434] [2022-09-16 13:26:49,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640589434] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:26:49,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:26:49,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:26:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530388347] [2022-09-16 13:26:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:26:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-16 13:26:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:26:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-16 13:26:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-16 13:26:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:49,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:26:49,744 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:26:49,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:49,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 13:26:49,809 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:26:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:26:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -186796936, now seen corresponding path program 1 times [2022-09-16 13:26:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:26:49,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001113151] [2022-09-16 13:26:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:26:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:26:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:26:50,127 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:26:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:26:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001113151] [2022-09-16 13:26:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001113151] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:26:50,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:26:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 13:26:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415083480] [2022-09-16 13:26:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:26:50,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 13:26:50,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:26:50,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 13:26:50,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-16 13:26:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:50,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:26:50,132 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:26:50,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:50,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:26:50,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 13:26:50,884 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:26:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:26:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 559929913, now seen corresponding path program 1 times [2022-09-16 13:26:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:26:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085676279] [2022-09-16 13:26:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:26:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:26:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:26:51,205 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:26:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:26:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085676279] [2022-09-16 13:26:51,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085676279] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:26:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935230165] [2022-09-16 13:26:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:26:51,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:26:51,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:26:51,209 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:26:51,210 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:26:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:26:51,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2022-09-16 13:26:51,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:26:52,168 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:26:52,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:26:52,468 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:26:52,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935230165] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:26:52,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:26:52,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-09-16 13:26:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804997604] [2022-09-16 13:26:52,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:26:52,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-09-16 13:26:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:26:52,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-09-16 13:26:52,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2022-09-16 13:26:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:52,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:26:52,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.571428571428571) internal successors, (240), 28 states have internal predecessors, (240), 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:26:52,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:52,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:26:52,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:26:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:26:54,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-16 13:26:54,329 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:26:54,330 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:26:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:26:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash -313608680, now seen corresponding path program 2 times [2022-09-16 13:26:54,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:26:54,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730792092] [2022-09-16 13:26:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:26:54,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:26:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:26:54,872 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:26:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:26:54,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730792092] [2022-09-16 13:26:54,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730792092] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:26:54,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863266672] [2022-09-16 13:26:54,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:26:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:26:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:26:54,876 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:26:54,877 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:26:55,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:26:55,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:26:55,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 13:26:55,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:26:55,638 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:26:55,797 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 13:26:55,797 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:26:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:26:56,048 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:26:56,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:26:56,105 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:26:56,162 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:26:56,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:26:56,227 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:26:56,259 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:26:56,290 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:26:56,305 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:26:56,311 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:26:56,336 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:26:56,362 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:26:56,393 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:26:56,422 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:26:56,422 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:26:56,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:26:56,434 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:26:56,446 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:26:56,450 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:26:56,876 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:26:56,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863266672] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:26:56,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:26:56,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 13:26:56,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361620443] [2022-09-16 13:26:56,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:26:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 13:26:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:26:56,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 13:26:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1414, Unknown=8, NotChecked=664, Total=2256 [2022-09-16 13:26:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:56,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:26:56,880 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:26:56,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:56,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:26:56,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:26:56,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:26:57,930 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:26:58,243 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:00,250 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:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:27:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:27:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:01,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 13:27:02,041 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:02,042 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:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -313608677, now seen corresponding path program 1 times [2022-09-16 13:27:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:02,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230189569] [2022-09-16 13:27:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:02,543 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:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:02,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230189569] [2022-09-16 13:27:02,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230189569] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:27:02,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810956739] [2022-09-16 13:27:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:02,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:27:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:02,546 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:02,547 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:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:02,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 34 conjunts are in the unsatisfiable core [2022-09-16 13:27:02,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:27:03,213 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:03,362 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 13:27:03,363 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:03,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:03,585 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:03,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:03,630 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:03,684 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:03,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:27:03,751 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:03,770 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:03,799 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:03,809 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:03,814 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:03,843 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:03,864 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:03,894 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:03,919 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:27:03,920 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:03,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:03,927 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:03,932 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:03,935 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:04,378 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:04,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810956739] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:27:04,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:27:04,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 13:27:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003472884] [2022-09-16 13:27:04,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:27:04,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 13:27:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:27:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 13:27:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1414, Unknown=8, NotChecked=664, Total=2256 [2022-09-16 13:27:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:04,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:27:04,381 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:04,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:04,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:27:04,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:27:04,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:04,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:05,284 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) (<= .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))) (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:05,591 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|) (<= (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))) (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:07,595 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:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:27:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 13:27:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:27:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:27:09,122 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:09,293 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:09,294 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:09,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:27:09,294 INFO L85 PathProgramCache]: Analyzing trace with hash -313608676, now seen corresponding path program 1 times [2022-09-16 13:27:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:27:09,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588063062] [2022-09-16 13:27:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:27:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:27:10,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:27:10,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588063062] [2022-09-16 13:27:10,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588063062] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:27:10,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333257987] [2022-09-16 13:27:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:27:10,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:27:10,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:27:10,811 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:10,812 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:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:27:11,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 48 conjunts are in the unsatisfiable core [2022-09-16 13:27:11,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:27:11,287 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:11,490 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:11,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:11,731 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:12,118 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:27:12,118 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:12,260 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:12,336 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:12,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:12,510 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:12,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:27:12,568 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:12,624 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:12,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:27:14,950 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 (< (+ 9223372039002259455 .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 (not (<= .cse2 0)) (not (<= 0 .cse2)) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647)))))) is different from false [2022-09-16 13:27:15,054 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 (not (<= .cse2 0)) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647) (not (<= 0 .cse2))))))) is different from false [2022-09-16 13:27:15,430 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 ((.cse2 (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 ((.cse3 (select (select .cse2 ~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) .cse3) 2147483647) (not (<= .cse3 0)) (not (<= 0 .cse3))))))) is different from false [2022-09-16 13:27:15,698 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) (not (<= .cse0 0)) (not (<= 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 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) 2147483647) (< (+ 9223372039002259455 .cse2) 0) (<= 0 .cse2)))))) is different from false [2022-09-16 13:27:44,920 INFO L356 Elim1Store]: treesize reduction 40, result has 62.6 percent of original size [2022-09-16 13:27:44,920 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 307 treesize of output 231 [2022-09-16 13:27:44,976 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-09-16 13:27:44,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22136 treesize of output 21600 [2022-09-16 13:27:45,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:45,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 21561 treesize of output 20482 [2022-09-16 13:27:45,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:45,328 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 20473 treesize of output 18306 [2022-09-16 13:27:45,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:45,478 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 18297 treesize of output 17762 [2022-09-16 13:27:45,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:45,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20446 treesize of output 20398 [2022-09-16 13:27:45,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:45,864 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 20345 treesize of output 20082 [2022-09-16 13:27:46,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:46,112 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 20073 treesize of output 19946 [2022-09-16 13:27:46,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:27:46,306 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 19937 treesize of output 19878 Received shutdown request... [2022-09-16 13:40:06,589 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-09-16 13:40:06,592 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-09-16 13:40:06,604 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:06,604 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:06,608 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:06,612 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:06,795 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:06,796 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 137 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-09-16 13:40:06,798 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-09-16 13:40:06,798 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-09-16 13:40:06,798 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-09-16 13:40:06,798 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-09-16 13:40:06,798 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-09-16 13:40:06,799 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-09-16 13:40:06,799 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-09-16 13:40:06,799 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-09-16 13:40:06,799 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-09-16 13:40:06,799 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-09-16 13:40:06,800 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-09-16 13:40:06,800 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-09-16 13:40:06,800 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-09-16 13:40:06,804 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-09-16 13:40:06,806 INFO L307 ceAbstractionStarter]: Result for error location thread2Thread1of1ForFork2 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/4) [2022-09-16 13:40:06,808 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 13:40:06,808 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 13:40:06,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 01:40:06 BasicIcfg [2022-09-16 13:40:06,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 13:40:06,811 INFO L158 Benchmark]: Toolchain (without parser) took 800787.23ms. Allocated memory was 196.1MB in the beginning and 814.7MB in the end (delta: 618.7MB). Free memory was 143.0MB in the beginning and 409.5MB in the end (delta: -266.5MB). Peak memory consumption was 521.7MB. Max. memory is 8.0GB. [2022-09-16 13:40:06,812 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory was 159.2MB in the beginning and 159.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 13:40:06,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.17ms. Allocated memory is still 196.1MB. Free memory was 142.8MB in the beginning and 170.5MB in the end (delta: -27.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-09-16 13:40:06,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.84ms. Allocated memory is still 196.1MB. Free memory was 170.5MB in the beginning and 167.6MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 13:40:06,815 INFO L158 Benchmark]: Boogie Preprocessor took 53.45ms. Allocated memory is still 196.1MB. Free memory was 167.6MB in the beginning and 165.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 13:40:06,816 INFO L158 Benchmark]: RCFGBuilder took 2294.25ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 165.5MB in the beginning and 131.1MB in the end (delta: 34.4MB). Peak memory consumption was 148.2MB. Max. memory is 8.0GB. [2022-09-16 13:40:06,816 INFO L158 Benchmark]: TraceAbstraction took 798068.83ms. Allocated memory was 255.9MB in the beginning and 814.7MB in the end (delta: 558.9MB). Free memory was 130.6MB in the beginning and 409.5MB in the end (delta: -278.9MB). Peak memory consumption was 449.1MB. Max. memory is 8.0GB. [2022-09-16 13:40:06,818 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 196.1MB. Free memory was 159.2MB in the beginning and 159.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.17ms. Allocated memory is still 196.1MB. Free memory was 142.8MB in the beginning and 170.5MB in the end (delta: -27.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.84ms. Allocated memory is still 196.1MB. Free memory was 170.5MB in the beginning and 167.6MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.45ms. Allocated memory is still 196.1MB. Free memory was 167.6MB in the beginning and 165.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2294.25ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 165.5MB in the beginning and 131.1MB in the end (delta: 34.4MB). Peak memory consumption was 148.2MB. Max. memory is 8.0GB. * TraceAbstraction took 798068.83ms. Allocated memory was 255.9MB in the beginning and 814.7MB in the end (delta: 558.9MB). Free memory was 130.6MB in the beginning and 409.5MB in the end (delta: -278.9MB). Peak memory consumption was 449.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: 6770, positive: 4550, positive conditional: 1087, positive unconditional: 3463, negative: 2220, negative conditional: 2213, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4676, positive: 4550, positive conditional: 1087, positive unconditional: 3463, negative: 126, negative conditional: 119, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4676, positive: 4550, positive conditional: 1087, positive unconditional: 3463, negative: 126, negative conditional: 119, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5005, positive: 4550, positive conditional: 0, positive unconditional: 4550, negative: 455, negative conditional: 329, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5005, positive: 4550, positive conditional: 0, positive unconditional: 4550, negative: 455, negative conditional: 105, negative unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5005, positive: 4550, positive conditional: 0, positive unconditional: 4550, negative: 455, negative conditional: 105, negative unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3349, positive: 3308, positive conditional: 0, positive unconditional: 3308, 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: 3349, positive: 3296, positive conditional: 0, positive unconditional: 3296, 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: 748, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 598, negative conditional: 410, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5005, positive: 1242, positive conditional: 0, positive unconditional: 1242, negative: 414, negative conditional: 77, negative unconditional: 337, unknown: 3349, unknown conditional: 28, unknown unconditional: 3321] , Statistics on independence cache: Total cache size (in pairs): 3349, Positive cache size: 3308, Positive conditional cache size: 0, Positive unconditional cache size: 3308, Negative cache size: 41, Negative conditional cache size: 28, Negative unconditional cache size: 13, Eliminated conditions: 224, Maximal queried relation: 4, Independence queries for same thread: 2094 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 159, Number of trivial persistent sets: 135, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3470, positive: 3463, positive conditional: 0, positive unconditional: 3463, 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: 6770, positive: 4550, positive conditional: 1087, positive unconditional: 3463, negative: 2220, negative conditional: 2213, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4676, positive: 4550, positive conditional: 1087, positive unconditional: 3463, negative: 126, negative conditional: 119, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4676, positive: 4550, positive conditional: 1087, positive unconditional: 3463, negative: 126, negative conditional: 119, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5005, positive: 4550, positive conditional: 0, positive unconditional: 4550, negative: 455, negative conditional: 329, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5005, positive: 4550, positive conditional: 0, positive unconditional: 4550, negative: 455, negative conditional: 105, negative unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5005, positive: 4550, positive conditional: 0, positive unconditional: 4550, negative: 455, negative conditional: 105, negative unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3349, positive: 3308, positive conditional: 0, positive unconditional: 3308, 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: 3349, positive: 3296, positive conditional: 0, positive unconditional: 3296, 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: 748, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 598, negative conditional: 410, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5005, positive: 1242, positive conditional: 0, positive unconditional: 1242, negative: 414, negative conditional: 77, negative unconditional: 337, unknown: 3349, unknown conditional: 28, unknown unconditional: 3321] , Statistics on independence cache: Total cache size (in pairs): 3349, Positive cache size: 3308, Positive conditional cache size: 0, Positive unconditional cache size: 3308, Negative cache size: 41, Negative conditional cache size: 28, Negative unconditional cache size: 13, Eliminated conditions: 224, Maximal queried relation: 4, Independence queries for same thread: 2094 - TimeoutResultAtElement [Line: 125]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 123]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 123]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 124]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 124]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 125]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 123]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 123]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 124]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 124]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 125]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 125]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 61]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 61]: 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 317 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 797.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 12.4s, 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: 107, 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.3s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1364 ConstructedInterpolants, 72 QuantifiedInterpolants, 11623 SizeOfPredicates, 45 NumberOfNonLiveVariables, 913 ConjunctsInSsa, 82 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