/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 18:29:00,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 18:29:00,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 18:29:00,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 18:29:00,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 18:29:00,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 18:29:00,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 18:29:00,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 18:29:00,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 18:29:00,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 18:29:00,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 18:29:00,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 18:29:00,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 18:29:00,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 18:29:00,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 18:29:00,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 18:29:00,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 18:29:00,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 18:29:00,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 18:29:00,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 18:29:00,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 18:29:00,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 18:29:00,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 18:29:00,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 18:29:00,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 18:29:00,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 18:29:00,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 18:29:00,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 18:29:00,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 18:29:00,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 18:29:00,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 18:29:00,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 18:29:00,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 18:29:00,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 18:29:00,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 18:29:00,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 18:29:00,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 18:29:00,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 18:29:00,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 18:29:00,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 18:29:00,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 18:29:00,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 18:29:00,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 18:29:00,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 18:29:00,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 18:29:00,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 18:29:00,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 18:29:00,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 18:29:00,102 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 18:29:00,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 18:29:00,102 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 18:29:00,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 18:29:00,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 18:29:00,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 18:29:00,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 18:29:00,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:29:00,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 18:29:00,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 18:29:00,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 18:29:00,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 18:29:00,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 18:29:00,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 18:29:00,367 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 18:29:00,368 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 18:29:00,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-06 18:29:01,369 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 18:29:01,532 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 18:29:01,532 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-06 18:29:01,537 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ee9c6009/af75edcab6f14eaaa3800112ea32e3c6/FLAG90b22df04 [2022-12-06 18:29:01,556 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ee9c6009/af75edcab6f14eaaa3800112ea32e3c6 [2022-12-06 18:29:01,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 18:29:01,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 18:29:01,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 18:29:01,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 18:29:01,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 18:29:01,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ede7b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01, skipping insertion in model container [2022-12-06 18:29:01,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 18:29:01,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 18:29:01,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,725 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-12-06 18:29:01,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:29:01,744 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 18:29:01,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:29:01,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:29:01,773 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-12-06 18:29:01,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:29:01,790 INFO L208 MainTranslator]: Completed translation [2022-12-06 18:29:01,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01 WrapperNode [2022-12-06 18:29:01,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 18:29:01,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 18:29:01,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 18:29:01,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 18:29:01,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,836 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-12-06 18:29:01,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 18:29:01,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 18:29:01,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 18:29:01,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 18:29:01,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 18:29:01,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 18:29:01,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 18:29:01,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 18:29:01,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (1/1) ... [2022-12-06 18:29:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:29:01,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:29:01,904 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-12-06 18:29:01,912 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-12-06 18:29:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 18:29:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 18:29:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 18:29:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 18:29:01,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 18:29:01,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 18:29:01,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 18:29:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 18:29:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 18:29:01,937 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 18:29:02,036 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 18:29:02,037 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 18:29:02,258 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 18:29:02,366 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 18:29:02,367 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 18:29:02,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:02 BoogieIcfgContainer [2022-12-06 18:29:02,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 18:29:02,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 18:29:02,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 18:29:02,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 18:29:02,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:29:01" (1/3) ... [2022-12-06 18:29:02,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4936af6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:02, skipping insertion in model container [2022-12-06 18:29:02,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:01" (2/3) ... [2022-12-06 18:29:02,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4936af6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:02, skipping insertion in model container [2022-12-06 18:29:02,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:02" (3/3) ... [2022-12-06 18:29:02,381 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-12-06 18:29:02,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 18:29:02,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 18:29:02,393 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 18:29:02,448 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 18:29:02,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 342 flow [2022-12-06 18:29:02,567 INFO L130 PetriNetUnfolder]: 13/161 cut-off events. [2022-12-06 18:29:02,567 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 18:29:02,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 161 events. 13/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-06 18:29:02,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 342 flow [2022-12-06 18:29:02,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-06 18:29:02,588 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 18:29:02,594 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@409b88d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 18:29:02,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 18:29:02,637 INFO L130 PetriNetUnfolder]: 13/152 cut-off events. [2022-12-06 18:29:02,638 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 18:29:02,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:02,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:02,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash -457247972, now seen corresponding path program 1 times [2022-12-06 18:29:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:02,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189005635] [2022-12-06 18:29:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:29:03,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189005635] [2022-12-06 18:29:03,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189005635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:29:03,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:29:03,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:29:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565528907] [2022-12-06 18:29:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:29:03,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:29:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:29:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:29:03,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 163 [2022-12-06 18:29:03,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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-12-06 18:29:03,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:03,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 163 [2022-12-06 18:29:03,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:03,470 INFO L130 PetriNetUnfolder]: 112/411 cut-off events. [2022-12-06 18:29:03,470 INFO L131 PetriNetUnfolder]: For 71/82 co-relation queries the response was YES. [2022-12-06 18:29:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 411 events. 112/411 cut-off events. For 71/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1532 event pairs, 56 based on Foata normal form. 9/366 useless extension candidates. Maximal degree in co-relation 435. Up to 120 conditions per place. [2022-12-06 18:29:03,474 INFO L137 encePairwiseOnDemand]: 142/163 looper letters, 59 selfloop transitions, 5 changer transitions 11/176 dead transitions. [2022-12-06 18:29:03,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 176 transitions, 529 flow [2022-12-06 18:29:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 18:29:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 18:29:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2022-12-06 18:29:03,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7368779822767553 [2022-12-06 18:29:03,490 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2022-12-06 18:29:03,490 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 176 transitions, 529 flow [2022-12-06 18:29:03,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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-12-06 18:29:03,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:03,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 18:29:03,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 618458616, now seen corresponding path program 1 times [2022-12-06 18:29:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:03,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392021471] [2022-12-06 18:29:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:29:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392021471] [2022-12-06 18:29:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392021471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:29:03,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:29:03,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:29:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478311697] [2022-12-06 18:29:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:29:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:29:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:29:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:29:03,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 163 [2022-12-06 18:29:03,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 176 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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-12-06 18:29:03,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:03,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 163 [2022-12-06 18:29:03,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:03,842 INFO L130 PetriNetUnfolder]: 123/479 cut-off events. [2022-12-06 18:29:03,843 INFO L131 PetriNetUnfolder]: For 244/453 co-relation queries the response was YES. [2022-12-06 18:29:03,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 479 events. 123/479 cut-off events. For 244/453 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1866 event pairs, 44 based on Foata normal form. 11/422 useless extension candidates. Maximal degree in co-relation 541. Up to 120 conditions per place. [2022-12-06 18:29:03,850 INFO L137 encePairwiseOnDemand]: 154/163 looper letters, 44 selfloop transitions, 6 changer transitions 17/186 dead transitions. [2022-12-06 18:29:03,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 186 transitions, 685 flow [2022-12-06 18:29:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 18:29:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 18:29:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2022-12-06 18:29:03,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7703768624014022 [2022-12-06 18:29:03,859 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2022-12-06 18:29:03,859 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 186 transitions, 685 flow [2022-12-06 18:29:03,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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-12-06 18:29:03,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:03,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:03,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 18:29:03,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:03,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1099596155, now seen corresponding path program 1 times [2022-12-06 18:29:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:03,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553380053] [2022-12-06 18:29:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553380053] [2022-12-06 18:29:04,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553380053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:29:04,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:29:04,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 18:29:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983117831] [2022-12-06 18:29:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:29:04,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 18:29:04,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 18:29:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 18:29:04,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2022-12-06 18:29:04,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 186 transitions, 685 flow. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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-12-06 18:29:04,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:04,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2022-12-06 18:29:04,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:04,136 INFO L130 PetriNetUnfolder]: 116/468 cut-off events. [2022-12-06 18:29:04,137 INFO L131 PetriNetUnfolder]: For 431/1380 co-relation queries the response was YES. [2022-12-06 18:29:04,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 468 events. 116/468 cut-off events. For 431/1380 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1812 event pairs, 26 based on Foata normal form. 13/424 useless extension candidates. Maximal degree in co-relation 718. Up to 120 conditions per place. [2022-12-06 18:29:04,140 INFO L137 encePairwiseOnDemand]: 155/163 looper letters, 41 selfloop transitions, 7 changer transitions 19/192 dead transitions. [2022-12-06 18:29:04,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 192 transitions, 843 flow [2022-12-06 18:29:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 18:29:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 18:29:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-12-06 18:29:04,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8736196319018404 [2022-12-06 18:29:04,143 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 18 predicate places. [2022-12-06 18:29:04,143 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 192 transitions, 843 flow [2022-12-06 18:29:04,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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-12-06 18:29:04,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:04,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:04,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 18:29:04,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 27771209, now seen corresponding path program 2 times [2022-12-06 18:29:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725211212] [2022-12-06 18:29:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:04,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725211212] [2022-12-06 18:29:04,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725211212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:29:04,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:29:04,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 18:29:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223070858] [2022-12-06 18:29:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:29:04,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 18:29:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 18:29:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 18:29:04,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2022-12-06 18:29:04,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 192 transitions, 843 flow. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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-12-06 18:29:04,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:04,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2022-12-06 18:29:04,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:04,390 INFO L130 PetriNetUnfolder]: 109/467 cut-off events. [2022-12-06 18:29:04,390 INFO L131 PetriNetUnfolder]: For 569/1193 co-relation queries the response was YES. [2022-12-06 18:29:04,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 467 events. 109/467 cut-off events. For 569/1193 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1792 event pairs, 38 based on Foata normal form. 24/442 useless extension candidates. Maximal degree in co-relation 868. Up to 119 conditions per place. [2022-12-06 18:29:04,393 INFO L137 encePairwiseOnDemand]: 153/163 looper letters, 37 selfloop transitions, 7 changer transitions 25/194 dead transitions. [2022-12-06 18:29:04,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 194 transitions, 973 flow [2022-12-06 18:29:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 18:29:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 18:29:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2022-12-06 18:29:04,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8723926380368098 [2022-12-06 18:29:04,396 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 22 predicate places. [2022-12-06 18:29:04,396 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 194 transitions, 973 flow [2022-12-06 18:29:04,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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-12-06 18:29:04,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:04,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 18:29:04,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash 260744839, now seen corresponding path program 3 times [2022-12-06 18:29:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419620013] [2022-12-06 18:29:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:04,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419620013] [2022-12-06 18:29:04,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419620013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:29:04,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780356966] [2022-12-06 18:29:04,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 18:29:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:29:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:29:04,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 18:29:04,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 18:29:04,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 18:29:04,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:29:04,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 18:29:04,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:29:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:04,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:29:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:05,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780356966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:29:05,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:29:05,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 18:29:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693072303] [2022-12-06 18:29:05,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:29:05,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 18:29:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:05,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 18:29:05,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-06 18:29:05,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2022-12-06 18:29:05,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 194 transitions, 973 flow. Second operand has 11 states, 11 states have (on average 135.9090909090909) internal successors, (1495), 11 states have internal predecessors, (1495), 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-12-06 18:29:05,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:05,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2022-12-06 18:29:05,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:05,330 INFO L130 PetriNetUnfolder]: 133/569 cut-off events. [2022-12-06 18:29:05,330 INFO L131 PetriNetUnfolder]: For 939/1278 co-relation queries the response was YES. [2022-12-06 18:29:05,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 569 events. 133/569 cut-off events. For 939/1278 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2451 event pairs, 16 based on Foata normal form. 23/540 useless extension candidates. Maximal degree in co-relation 1451. Up to 183 conditions per place. [2022-12-06 18:29:05,333 INFO L137 encePairwiseOnDemand]: 155/163 looper letters, 65 selfloop transitions, 21 changer transitions 25/236 dead transitions. [2022-12-06 18:29:05,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 236 transitions, 1588 flow [2022-12-06 18:29:05,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 18:29:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 18:29:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1809 transitions. [2022-12-06 18:29:05,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.853704577630958 [2022-12-06 18:29:05,336 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 34 predicate places. [2022-12-06 18:29:05,336 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 236 transitions, 1588 flow [2022-12-06 18:29:05,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 135.9090909090909) internal successors, (1495), 11 states have internal predecessors, (1495), 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-12-06 18:29:05,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:05,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:05,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 18:29:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:29:05,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1561691815, now seen corresponding path program 1 times [2022-12-06 18:29:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:05,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256000973] [2022-12-06 18:29:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:05,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256000973] [2022-12-06 18:29:05,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256000973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:29:05,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:29:05,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:29:05,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047506067] [2022-12-06 18:29:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:29:05,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:29:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:29:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:29:05,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2022-12-06 18:29:05,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 236 transitions, 1588 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-12-06 18:29:05,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:05,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2022-12-06 18:29:05,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:05,770 INFO L130 PetriNetUnfolder]: 119/520 cut-off events. [2022-12-06 18:29:05,770 INFO L131 PetriNetUnfolder]: For 1032/1193 co-relation queries the response was YES. [2022-12-06 18:29:05,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 520 events. 119/520 cut-off events. For 1032/1193 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2070 event pairs, 11 based on Foata normal form. 11/489 useless extension candidates. Maximal degree in co-relation 1345. Up to 183 conditions per place. [2022-12-06 18:29:05,773 INFO L137 encePairwiseOnDemand]: 156/163 looper letters, 69 selfloop transitions, 8 changer transitions 24/223 dead transitions. [2022-12-06 18:29:05,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 223 transitions, 1642 flow [2022-12-06 18:29:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 18:29:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 18:29:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 838 transitions. [2022-12-06 18:29:05,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8568507157464212 [2022-12-06 18:29:05,777 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 37 predicate places. [2022-12-06 18:29:05,777 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 223 transitions, 1642 flow [2022-12-06 18:29:05,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-12-06 18:29:05,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:05,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:05,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 18:29:05,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1326729379, now seen corresponding path program 1 times [2022-12-06 18:29:05,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:05,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296295381] [2022-12-06 18:29:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:29:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296295381] [2022-12-06 18:29:05,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296295381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:29:05,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:29:05,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:29:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144113772] [2022-12-06 18:29:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:29:05,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:29:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:29:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:29:05,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 163 [2022-12-06 18:29:05,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 223 transitions, 1642 flow. Second operand has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 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-12-06 18:29:05,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:05,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 163 [2022-12-06 18:29:05,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:29:06,037 INFO L130 PetriNetUnfolder]: 132/668 cut-off events. [2022-12-06 18:29:06,037 INFO L131 PetriNetUnfolder]: For 2245/2671 co-relation queries the response was YES. [2022-12-06 18:29:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 668 events. 132/668 cut-off events. For 2245/2671 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2941 event pairs, 13 based on Foata normal form. 8/621 useless extension candidates. Maximal degree in co-relation 1573. Up to 183 conditions per place. [2022-12-06 18:29:06,040 INFO L137 encePairwiseOnDemand]: 152/163 looper letters, 65 selfloop transitions, 8 changer transitions 55/258 dead transitions. [2022-12-06 18:29:06,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 258 transitions, 2182 flow [2022-12-06 18:29:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 18:29:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 18:29:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1129 transitions. [2022-12-06 18:29:06,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7695978186775733 [2022-12-06 18:29:06,043 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 45 predicate places. [2022-12-06 18:29:06,043 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 258 transitions, 2182 flow [2022-12-06 18:29:06,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 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-12-06 18:29:06,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:29:06,044 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:29:06,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 18:29:06,044 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:29:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:29:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -698644721, now seen corresponding path program 1 times [2022-12-06 18:29:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:29:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751737827] [2022-12-06 18:29:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:29:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:29:10,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:29:10,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751737827] [2022-12-06 18:29:10,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751737827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:29:10,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65800176] [2022-12-06 18:29:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:29:10,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:29:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:29:10,615 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-12-06 18:29:10,616 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-12-06 18:29:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:29:10,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-06 18:29:10,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:29:12,785 INFO L350 Elim1Store]: Elim1 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-12-06 18:29:13,411 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-12-06 18:29:13,556 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-12-06 18:29:14,554 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 18:29:14,555 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 18 [2022-12-06 18:29:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:29:14,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:29:18,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:29:18,404 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 121 treesize of output 85 [2022-12-06 18:29:18,469 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-06 18:29:18,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 447 treesize of output 495 [2022-12-06 18:29:18,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:29:18,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 368 treesize of output 420 [2022-12-06 18:29:18,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:29:18,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 363 treesize of output 379 [2022-12-06 18:29:40,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:29:40,735 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 121 treesize of output 85 [2022-12-06 18:29:40,785 INFO L321 Elim1Store]: treesize reduction 55, result has 45.5 percent of original size [2022-12-06 18:29:40,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 452 [2022-12-06 18:29:40,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:29:40,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:29:40,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:29:40,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 380 treesize of output 376 [2022-12-06 18:29:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:29:40,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:29:40,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:29:40,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 371 treesize of output 331 [2022-12-06 18:29:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:29:43,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65800176] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:29:43,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:29:43,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 37] total 117 [2022-12-06 18:29:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117159764] [2022-12-06 18:29:43,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:29:43,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-12-06 18:29:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:29:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-12-06 18:29:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1296, Invalid=12246, Unknown=30, NotChecked=0, Total=13572 [2022-12-06 18:29:43,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 163 [2022-12-06 18:29:43,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 258 transitions, 2182 flow. Second operand has 117 states, 117 states have (on average 44.38461538461539) internal successors, (5193), 117 states have internal predecessors, (5193), 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-12-06 18:29:43,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:29:43,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 163 [2022-12-06 18:29:43,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:30:47,917 INFO L130 PetriNetUnfolder]: 1464/3479 cut-off events. [2022-12-06 18:30:47,917 INFO L131 PetriNetUnfolder]: For 9228/9384 co-relation queries the response was YES. [2022-12-06 18:30:47,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18299 conditions, 3479 events. 1464/3479 cut-off events. For 9228/9384 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 24687 event pairs, 74 based on Foata normal form. 51/3272 useless extension candidates. Maximal degree in co-relation 11555. Up to 1351 conditions per place. [2022-12-06 18:30:47,942 INFO L137 encePairwiseOnDemand]: 99/163 looper letters, 429 selfloop transitions, 375 changer transitions 175/1016 dead transitions. [2022-12-06 18:30:47,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1016 transitions, 11851 flow [2022-12-06 18:30:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2022-12-06 18:30:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2022-12-06 18:30:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 8880 transitions. [2022-12-06 18:30:47,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2852278932322616 [2022-12-06 18:30:47,957 INFO L294 CegarLoopForPetriNet]: 147 programPoint places, 235 predicate places. [2022-12-06 18:30:47,957 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 1016 transitions, 11851 flow [2022-12-06 18:30:47,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 44.38461538461539) internal successors, (5193), 117 states have internal predecessors, (5193), 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-12-06 18:30:47,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:30:47,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:30:47,980 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-12-06 18:30:48,164 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,SelfDestructingSolverStorable7 [2022-12-06 18:30:48,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:30:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:30:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1899884381, now seen corresponding path program 2 times [2022-12-06 18:30:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:30:48,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435084273] [2022-12-06 18:30:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:30:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:30:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:30:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:30:51,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:30:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435084273] [2022-12-06 18:30:51,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435084273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:30:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732274712] [2022-12-06 18:30:51,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 18:30:51,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:30:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:30:51,992 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-12-06 18:30:51,993 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-12-06 18:30:52,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 18:30:52,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:30:52,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-06 18:30:52,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:30:52,105 INFO L350 Elim1Store]: Elim1 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-12-06 18:30:52,169 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 18:30:52,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-12-06 18:30:52,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:30:52,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-12-06 18:30:53,233 INFO L350 Elim1Store]: Elim1 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-12-06 18:30:54,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:30:54,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:30:54,143 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 18:30:54,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-12-06 18:30:54,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12-06 18:30:55,104 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-12-06 18:30:55,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:30:55,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 18:30:55,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2022-12-06 18:30:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:30:56,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:30:59,061 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse7 (* c_~q2_back~0 4)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (* c_~q2_front~0 4)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse1 (select .cse4 c_~q1~0.base)) (.cse0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse0 (+ (select .cse1 .cse2) 1)) (not (= (select .cse1 .cse3) c_~j~0)) (< .cse0 c_~i~0))))) (not (= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse12 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse11 (select .cse12 c_~q1~0.base))) (or (< (select .cse11 .cse2) (+ c_~i~0 1)) (not (= (select .cse11 .cse3) c_~j~0)) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)))))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~q2_back~0))) is different from false [2022-12-06 18:31:08,608 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-12-06 18:31:08,608 INFO L350 Elim1Store]: Elim1 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 264 treesize of output 126 [2022-12-06 18:31:08,712 INFO L321 Elim1Store]: treesize reduction 4, result has 97.5 percent of original size [2022-12-06 18:31:08,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 639 treesize of output 701 [2022-12-06 18:31:08,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:31:08,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 516 [2022-12-06 18:31:08,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:31:08,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 437 treesize of output 361 [2022-12-06 18:31:33,264 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-12-06 18:31:33,264 INFO L350 Elim1Store]: Elim1 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 214 treesize of output 112 [2022-12-06 18:31:33,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:31:33,388 INFO L321 Elim1Store]: treesize reduction 4, result has 97.5 percent of original size [2022-12-06 18:31:33,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 239 treesize of output 357 [2022-12-06 18:31:33,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:31:33,459 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 120 [2022-12-06 18:31:33,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:31:33,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 184 [2022-12-06 18:31:52,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:31:52,545 INFO L350 Elim1Store]: Elim1 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 219 treesize of output 222 [2022-12-06 18:31:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 18:31:52,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732274712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:31:52,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:31:52,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 44] total 122 [2022-12-06 18:31:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65174410] [2022-12-06 18:31:52,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:31:52,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-12-06 18:31:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:31:52,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-12-06 18:31:52,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1190, Invalid=13280, Unknown=54, NotChecked=238, Total=14762 [2022-12-06 18:31:52,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 163 [2022-12-06 18:31:52,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1016 transitions, 11851 flow. Second operand has 122 states, 122 states have (on average 41.24590163934426) internal successors, (5032), 122 states have internal predecessors, (5032), 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-12-06 18:31:52,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:31:52,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 163 [2022-12-06 18:31:52,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:33:23,723 WARN L233 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 463 DAG size of output: 456 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:34:56,084 WARN L233 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 438 DAG size of output: 435 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:34:58,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:35:10,572 WARN L233 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 238 DAG size of output: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:36:03,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:36:05,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)) (.cse18 (* c_~q2_back~0 4)) (.cse11 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse12 (+ c_~i~0 1)) (.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse17 (* c_~q2_front~0 4)) (.cse24 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (not (<= 0 c_~q1_back~0))) (.cse2 (not (< c_~q2_back~0 c_~n2~0))) (.cse3 (not (< c_~q1_back~0 c_~n1~0))) (.cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse19 (not (<= 0 c_~q2_back~0)))) (and .cse0 (or .cse0 (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= c_~i~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q2_front~0 c_~q2_back~0) (or .cse1 .cse2 .cse3 .cse4 (let ((.cse6 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse7 (select .cse9 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse7 .cse8))) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10) c_~i~0) (< (select .cse7 .cse11) .cse12)))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10)) (.cse14 (select .cse16 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse14 .cse8))) (< .cse15 c_~i~0) (< .cse15 (+ (select .cse14 .cse11) 1))))))))))) .cse19) (= c_~q1_back~0 c_~q1_front~0) (or (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse21 (select .cse22 c_~q1~0.base))) (or (< .cse20 c_~i~0) (not (= (select .cse21 .cse8) c_~j~0)) (< .cse20 (+ (select .cse21 .cse11) 1)))))) (not (= (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse18 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse25 (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse26 (select .cse25 c_~q1~0.base))) (or (< (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= (select .cse26 .cse8) c_~j~0)) (< (select .cse26 .cse11) .cse12))))) (not (= (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse18 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0))))) .cse1 .cse2 .cse3 .cse19) (or (let ((.cse32 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse29 (select .cse30 c_~q1~0.base)) (.cse28 (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse28 (+ (select .cse29 .cse11) 1)) (not (= (select .cse29 .cse8) c_~j~0)) (< .cse28 c_~i~0))))) (not (= (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse18 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse18 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse34 (select .cse35 c_~q1~0.base))) (or (< (select .cse34 .cse11) .cse12) (not (= (select .cse34 .cse8) c_~j~0)) (< (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)))))))))) .cse1 .cse2 .cse3 .cse4 .cse19) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_~j~0 0))) is different from false [2022-12-06 18:37:17,044 WARN L233 SmtUtils]: Spent 26.07s on a formula simplification. DAG size of input: 392 DAG size of output: 313 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:37:50,366 WARN L233 SmtUtils]: Spent 20.21s on a formula simplification. DAG size of input: 342 DAG size of output: 270 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:38:29,044 WARN L233 SmtUtils]: Spent 29.08s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:38:32,365 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse78 (+ c_~j~0 1)) (.cse60 (* c_~q1_back~0 4)) (.cse61 (* c_~q1_front~0 4)) (.cse3 (+ c_~i~0 1))) (let ((.cse139 (< c_~j~0 .cse3)) (.cse138 (= .cse60 .cse61)) (.cse136 (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|))) (.cse140 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_25| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_25| |c_#StackHeapBarrier|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_25| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))) (.cse133 (< c_~i~0 .cse78)) (.cse13 (* c_~q2_back~0 4)) (.cse12 (* c_~q2_front~0 4)) (.cse2 (+ .cse61 c_~q1~0.offset))) (let ((.cse94 (= .cse2 0)) (.cse121 (= c_~j~0 0)) (.cse1 (+ .cse60 c_~q1~0.offset)) (.cse62 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base))) (.cse131 (select |c_#memory_int| c_~q2~0.base)) (.cse82 (+ c_~q2~0.offset .cse12)) (.cse132 (+ .cse13 c_~q2~0.offset)) (.cse18 (or .cse140 .cse133)) (.cse19 (or .cse136 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_25| |c_#StackHeapBarrier|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_25| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))))) (.cse135 (= .cse13 .cse12)) (.cse137 (< 0 c_~q2_back~0)) (.cse20 (or .cse138 .cse140)) (.cse21 (or .cse140 .cse139))) (let ((.cse23 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)) (.cse43 (and (or .cse137 (and .cse18 .cse19 (or .cse140 .cse135))) (or .cse137 (and .cse20 .cse21)))) (.cse22 (< 0 c_~q1_back~0)) (.cse69 (or (<= .cse132 0) (<= c_~n2~0 1))) (.cse93 (let ((.cse134 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) (and (or (and (or .cse133 .cse134) (or .cse135 .cse134) (or .cse136 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) .cse137) (or .cse137 (and (or .cse138 .cse134) (or .cse139 .cse134)))))) (.cse15 (not (< c_~q2_back~0 c_~n2~0))) (.cse103 (select .cse131 .cse82)) (.cse63 (not (= .cse132 0))) (.cse64 (<= c_~q2_back~0 c_~q2_front~0)) (.cse65 (or .cse62 (not (= .cse82 0)))) (.cse66 (or (and (or (not .cse94) .cse121) (not (<= (+ .cse61 c_~q1~0.offset 1) 0)) (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 1)) (<= .cse2 0))) (not (= .cse1 0)))) (.cse67 (or (<= (+ c_~q2_front~0 c_~n2~0) (+ c_~q2_back~0 1)) (<= .cse82 0))) (.cse68 (or (<= c_~n1~0 1) (<= .cse1 0))) (.cse70 (not (= c_~i~0 (select .cse131 .cse132)))) (.cse85 (let ((.cse124 (+ .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse126 (+ .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (v_subst_1 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse125 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) v_subst_1) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse127 (store .cse125 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse122 (select (select .cse127 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 v_subst_1))) (.cse123 (select .cse127 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (< .cse122 (+ (select .cse123 .cse124) 1)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (< .cse122 c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (not (= (select (select .cse125 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 v_subst_1)) c_~i~0)) (not (= c_~j~0 (select .cse123 .cse126)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse130 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) v_subst_2) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse129 (store .cse130 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse128 (select .cse129 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse128 .cse124) .cse3) (< (select (select .cse129 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 v_subst_2)) c_~i~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~j~0 (select .cse128 .cse126))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (not (= (select (select .cse130 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 v_subst_2)) c_~i~0)))))))))) (.cse14 (not (<= 0 c_~q1_back~0))) (.cse16 (not (< c_~q1_back~0 c_~n1~0))) (.cse17 (not (<= 0 c_~q2_back~0)))) (and (or (let ((.cse7 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse5 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse0 (select .cse4 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) .cse3) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse5) c_~i~0))))) (not (= c_~i~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= c_~i~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7))) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse11 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse9 (select .cse11 c_~q1~0.base)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse5))) (or (not (= c_~j~0 (select .cse9 .cse1))) (< .cse10 (+ (select .cse9 .cse2) 1)) (< .cse10 c_~i~0)))))))))) .cse14 .cse15 .cse16 .cse17) (= c_~q2~0.offset 0) (or .cse14 (and .cse18 .cse19 .cse20 .cse21) .cse22) .cse23 (or .cse14 .cse15 .cse16 (let ((.cse25 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse28 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse25) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse27 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse26 (select .cse27 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse26 .cse1))) (< (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28) c_~i~0) (< (select .cse26 .cse2) .cse3)))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse25) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse32 (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse31 (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28)) (.cse30 (select .cse32 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse30 .cse1))) (< .cse31 c_~i~0) (< .cse31 (+ (select .cse30 .cse2) 1))))))))))) .cse17) (or .cse14 .cse15 (let ((.cse36 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse12)) (.cse38 (+ .cse13 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse35 (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse36)) (.cse33 (select .cse35 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse33 .cse1))) (< .cse34 c_~i~0) (< .cse34 (+ (select .cse33 .cse2) 1)))))) (not (= c_~i~0 (select (select .cse37 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse38)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse39 (select .cse40 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse39 .cse1))) (< (select (select .cse40 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse36) c_~i~0) (< (select .cse39 .cse2) .cse3))))) (not (= c_~i~0 (select (select .cse41 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse38)))))))) .cse16 .cse17) (exists ((~q2~0.base Int) (~q2~0.offset Int) (v_~q2_front~0_33 Int)) (let ((.cse42 (select (select |c_#memory_int| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_front~0_33))))) (and (<= c_~j~0 .cse42) (= .cse42 0) (<= 0 v_~q2_front~0_33) (<= v_~q2_front~0_33 0) (not (= c_~q1~0.base ~q2~0.base))))) (= c_~q1~0.offset 0) (or .cse23 (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or .cse14 .cse43 .cse16 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse17) (= c_~i~0 0) (or .cse14 .cse16 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse45 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse46 (store .cse45 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse44 (select .cse46 c_~q1~0.base))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~j~0 (select .cse44 .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (< (select .cse44 .cse2) .cse3) (not (= c_~i~0 (select (select .cse45 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select .cse46 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse49 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse50 (store .cse49 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse48 (select .cse50 c_~q1~0.base)) (.cse47 (select (select .cse50 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (< .cse47 (+ (select .cse48 .cse2) 1)) (not (= c_~j~0 (select .cse48 .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~i~0 (select (select .cse49 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< .cse47 c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))))) .cse17) (<= 0 c_~q1_front~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~q2~0.base)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (let ((.cse55 (+ .cse61 |c_ULTIMATE.start_main_#t~ret16#1.offset|)) (.cse54 (+ .cse60 |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse51 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse56 (store .cse51 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse52 (select (select .cse56 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse53 (select .cse56 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~i~0 (select (select .cse51 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< .cse52 c_~i~0) (not (= c_~j~0 (select .cse53 .cse54))) (< .cse52 (+ (select .cse53 .cse55) 1)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse58 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse59 (store .cse58 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (< (select .cse57 .cse55) .cse3) (not (= c_~i~0 (select (select .cse58 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select .cse59 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~j~0 (select .cse57 .cse54))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))))) .cse14 .cse16 .cse17) .cse62 (<= c_~q2_front~0 0) (or (and (or .cse63 (and .cse64 .cse65 .cse66 .cse67 (<= .cse3 c_~N~0) .cse68)) .cse69) .cse70) (or .cse14 .cse15 .cse16 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse71 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= c_~i~0 (select (select .cse71 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse74 (store .cse71 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse73 (select .cse74 c_~q1~0.base)) (.cse72 (select (select .cse74 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse72 (+ (select .cse73 .cse2) 1)) (not (= c_~j~0 (select .cse73 .cse1))) (< .cse72 c_~i~0)))))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse77 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse75 (select .cse76 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse75 .cse1))) (< (select .cse75 .cse2) .cse3) (< (select (select .cse76 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse77 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))) .cse17) (<= .cse78 c_~N~0) (<= 1 c_~N~0) (or .cse14 .cse43 .cse22 .cse17) (or .cse14 .cse16 (and (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse80 (select (select .cse81 c_~q2~0.base) .cse82)) (.cse79 (select .cse81 c_~q1~0.base))) (or (not (= (select .cse79 .cse1) c_~j~0)) (< (+ .cse80 1) c_~N~0) (< .cse80 (+ (select .cse79 .cse2) 1)))))) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse83 (select .cse84 c_~q1~0.base))) (or (not (= (select .cse83 .cse1) c_~j~0)) (< (+ (select (select .cse84 c_~q2~0.base) .cse82) 1) c_~N~0) (< (select .cse83 .cse2) c_~N~0))))))) (not (= c_~q1~0.base c_~q2~0.base)) .cse66 .cse69 (or .cse85 .cse14 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post25#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16 .cse17) (<= 0 c_~q2_front~0) (or .cse14 .cse15 .cse16 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse87 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse88 (store .cse87 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse86 (select .cse88 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse86 .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (< (select .cse86 .cse2) .cse3) (not (= c_~i~0 (select (select .cse87 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select .cse88 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse91 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse92 (store .cse91 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse90 (select .cse92 c_~q1~0.base)) (.cse89 (select (select .cse92 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse89 (+ (select .cse90 .cse2) 1)) (not (= c_~j~0 (select .cse90 .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~i~0 (select (select .cse91 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< .cse89 c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))))))) .cse17) (or .cse93 .cse14 .cse16 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse17) .cse94 (< 0 c_~N~0) (or .cse14 .cse15 .cse16 (let ((.cse98 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse97 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base| (store .cse98 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse96 (store .cse97 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse95 (select .cse96 c_~q1~0.base))) (or (not (= (select .cse95 .cse1) c_~j~0)) (< (select (select .cse96 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse95 .cse2) .cse3))))) (not (= (select (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse99 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base| (store .cse98 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse99 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse102 (store .cse99 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse101 (select (select .cse102 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse100 (select .cse102 c_~q1~0.base))) (or (not (= (select .cse100 .cse1) c_~j~0)) (< .cse101 c_~i~0) (< .cse101 (+ (select .cse100 .cse2) 1))))))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))))) .cse17) (= .cse103 0) .cse68 (or .cse93 .cse14 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16 .cse17) (or .cse14 .cse16 (let ((.cse105 (+ .cse61 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse108 (+ .cse60 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse106 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse107 (store .cse106 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse104 (select .cse107 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (< (select .cse104 .cse105) .cse3) (not (= c_~i~0 (select (select .cse106 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select .cse107 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (not (= (select .cse104 .cse108) c_~j~0))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse111 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (let ((.cse112 (store .cse111 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse109 (select (select .cse112 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse110 (select .cse112 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< .cse109 (+ (select .cse110 .cse105) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~i~0 (select (select .cse111 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< .cse109 c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (not (= (select .cse110 .cse108) c_~j~0))))))))) .cse17) (or (let ((.cse117 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse116 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse117 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse115 (store .cse116 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse113 (select (select .cse115 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse114 (select .cse115 c_~q1~0.base))) (or (< .cse113 c_~i~0) (not (= (select .cse114 .cse1) c_~j~0)) (< .cse113 (+ (select .cse114 .cse2) 1)))))) (not (= (select (select .cse116 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (let ((.cse120 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse117 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse118 (store .cse120 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (let ((.cse119 (select .cse118 c_~q1~0.base))) (or (< (select (select .cse118 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= (select .cse119 .cse1) c_~j~0)) (< (select .cse119 .cse2) .cse3))))) (not (= (select (select .cse120 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))))) .cse14 .cse15 .cse16 .cse17) (<= (+ .cse103 1) c_~N~0) (<= c_~q1_front~0 0) (or .cse63 (and .cse64 .cse65 .cse66 .cse67 .cse68) .cse70) (= (select (select |c_#memory_int| c_~q1~0.base) .cse2) 0) (or .cse85 .cse14 .cse16 .cse17) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse121))))) is different from true [2022-12-06 18:38:42,473 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 497 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-06 18:43:27,014 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-12-06 18:43:27,023 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 18:43:27,399 WARN L249 SmtUtils]: Removed 9 from assertion stack [2022-12-06 18:43:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-12-06 18:43:27,401 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 18:43:27,407 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-12-06 18:43:27,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:43:27,602 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 468 for 277533ms.. [2022-12-06 18:43:27,603 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 18:43:27,603 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 18:43:27,603 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-06 18:43:27,606 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 18:43:27,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 18:43:27,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:43:27 BasicIcfg [2022-12-06 18:43:27,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 18:43:27,610 INFO L158 Benchmark]: Toolchain (without parser) took 866051.41ms. Allocated memory was 168.8MB in the beginning and 789.6MB in the end (delta: 620.8MB). Free memory was 143.5MB in the beginning and 477.7MB in the end (delta: -334.1MB). Peak memory consumption was 534.8MB. Max. memory is 8.0GB. [2022-12-06 18:43:27,610 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 18:43:27,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.34ms. Allocated memory is still 168.8MB. Free memory was 143.5MB in the beginning and 131.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 18:43:27,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.60ms. Allocated memory is still 168.8MB. Free memory was 131.0MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:43:27,611 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 168.8MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:43:27,611 INFO L158 Benchmark]: RCFGBuilder took 496.18ms. Allocated memory is still 168.8MB. Free memory was 126.8MB in the beginning and 99.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 18:43:27,611 INFO L158 Benchmark]: TraceAbstraction took 865233.25ms. Allocated memory was 168.8MB in the beginning and 789.6MB in the end (delta: 620.8MB). Free memory was 98.5MB in the beginning and 477.7MB in the end (delta: -379.2MB). Peak memory consumption was 489.7MB. Max. memory is 8.0GB. [2022-12-06 18:43:27,612 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.09ms. Allocated memory is still 168.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.34ms. Allocated memory is still 168.8MB. Free memory was 143.5MB in the beginning and 131.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.60ms. Allocated memory is still 168.8MB. Free memory was 131.0MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 168.8MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 496.18ms. Allocated memory is still 168.8MB. Free memory was 126.8MB in the beginning and 99.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 865233.25ms. Allocated memory was 168.8MB in the beginning and 789.6MB in the end (delta: 620.8MB). Free memory was 98.5MB in the beginning and 477.7MB in the end (delta: -379.2MB). Peak memory consumption was 489.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 468 for 277533ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 468 for 277533ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 468 for 277533ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 865.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 760.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 179 mSolverCounterUnknown, 7976 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7976 mSDsluCounter, 5916 SdHoareTripleChecker+Invalid, 21.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 182 IncrementalHoareTripleChecker+Unchecked, 5687 mSDsCounter, 1087 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16051 IncrementalHoareTripleChecker+Invalid, 17499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1087 mSolverCounterUnsat, 229 mSDtfsCounter, 16051 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 667 SyntacticMatches, 7 SemanticMatches, 562 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 42760 ImplicationChecksByTransitivity, 475.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11851occurred in iteration=8, InterpolantAutomatonStates: 245, 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, 103.1s InterpolantComputationTime, 1550 NumberOfCodeBlocks, 1550 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1939 ConstructedInterpolants, 123 QuantifiedInterpolants, 49115 SizeOfPredicates, 115 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 13/40 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