/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 13:39:23,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 13:39:23,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 13:39:23,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 13:39:23,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 13:39:23,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 13:39:23,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 13:39:23,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 13:39:23,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 13:39:23,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 13:39:23,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 13:39:23,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 13:39:23,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 13:39:23,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 13:39:23,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 13:39:23,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 13:39:23,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 13:39:23,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 13:39:23,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 13:39:23,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 13:39:23,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 13:39:23,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 13:39:23,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 13:39:23,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 13:39:23,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 13:39:23,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 13:39:23,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 13:39:23,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 13:39:23,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 13:39:23,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 13:39:23,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 13:39:23,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 13:39:23,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 13:39:23,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 13:39:23,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 13:39:23,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 13:39:23,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 13:39:23,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 13:39:23,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 13:39:23,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 13:39:23,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 13:39:23,815 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-12 13:39:23,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 13:39:23,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 13:39:23,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 13:39:23,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 13:39:23,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 13:39:23,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 13:39:23,846 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 13:39:23,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 13:39:23,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 13:39:23,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 13:39:23,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 13:39:23,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 13:39:23,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 13:39:23,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 13:39:23,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 13:39:23,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:39:23,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 13:39:23,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 13:39:23,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 13:39:23,849 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 13:39:23,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 13:39:23,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 13:39:23,849 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 13:39:23,849 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 13:39:24,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 13:39:24,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 13:39:24,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 13:39:24,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 13:39:24,141 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 13:39:24,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-12 13:39:25,137 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 13:39:25,345 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 13:39:25,346 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-12 13:39:25,350 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c112cf/415f78a554d845a0a46db5e44162ec46/FLAG8ae3f68b9 [2022-12-12 13:39:25,362 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c112cf/415f78a554d845a0a46db5e44162ec46 [2022-12-12 13:39:25,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 13:39:25,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 13:39:25,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 13:39:25,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 13:39:25,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 13:39:25,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b32f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25, skipping insertion in model container [2022-12-12 13:39:25,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 13:39:25,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 13:39:25,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,522 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-send-receive.wvr.c[3107,3120] [2022-12-12 13:39:25,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:39:25,534 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 13:39:25,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:39:25,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:39:25,551 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-send-receive.wvr.c[3107,3120] [2022-12-12 13:39:25,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:39:25,562 INFO L208 MainTranslator]: Completed translation [2022-12-12 13:39:25,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25 WrapperNode [2022-12-12 13:39:25,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 13:39:25,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 13:39:25,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 13:39:25,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 13:39:25,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,609 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-12-12 13:39:25,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 13:39:25,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 13:39:25,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 13:39:25,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 13:39:25,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,646 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 13:39:25,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 13:39:25,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 13:39:25,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 13:39:25,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (1/1) ... [2022-12-12 13:39:25,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:39:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:25,678 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-12 13:39:25,715 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-12 13:39:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 13:39:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 13:39:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 13:39:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 13:39:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 13:39:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 13:39:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 13:39:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 13:39:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 13:39:25,744 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 13:39:25,812 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 13:39:25,813 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 13:39:26,044 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 13:39:26,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 13:39:26,127 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 13:39:26,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:39:26 BoogieIcfgContainer [2022-12-12 13:39:26,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 13:39:26,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 13:39:26,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 13:39:26,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 13:39:26,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:39:25" (1/3) ... [2022-12-12 13:39:26,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d48c94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:39:26, skipping insertion in model container [2022-12-12 13:39:26,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:39:25" (2/3) ... [2022-12-12 13:39:26,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d48c94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:39:26, skipping insertion in model container [2022-12-12 13:39:26,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:39:26" (3/3) ... [2022-12-12 13:39:26,141 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-12-12 13:39:26,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 13:39:26,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 13:39:26,155 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 13:39:26,216 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 13:39:26,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 132 transitions, 288 flow [2022-12-12 13:39:26,317 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2022-12-12 13:39:26,318 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 13:39:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 10/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-12 13:39:26,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 132 transitions, 288 flow [2022-12-12 13:39:26,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 256 flow [2022-12-12 13:39:26,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 13:39:26,349 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;@515cdd50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 13:39:26,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 13:39:26,390 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-12 13:39:26,390 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 13:39:26,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:26,391 INFO L214 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] [2022-12-12 13:39:26,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:39:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1220330430, now seen corresponding path program 1 times [2022-12-12 13:39:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:26,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361699278] [2022-12-12 13:39:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:26,997 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-12 13:39:26,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:26,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361699278] [2022-12-12 13:39:26,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361699278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:39:26,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:39:26,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:39:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474005513] [2022-12-12 13:39:27,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:39:27,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:39:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:39:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:39:27,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 132 [2022-12-12 13:39:27,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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-12 13:39:27,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:27,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 132 [2022-12-12 13:39:27,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:27,253 INFO L130 PetriNetUnfolder]: 156/571 cut-off events. [2022-12-12 13:39:27,254 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-12 13:39:27,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 571 events. 156/571 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3005 event pairs, 23 based on Foata normal form. 56/561 useless extension candidates. Maximal degree in co-relation 777. Up to 79 conditions per place. [2022-12-12 13:39:27,261 INFO L137 encePairwiseOnDemand]: 119/132 looper letters, 41 selfloop transitions, 9 changer transitions 6/148 dead transitions. [2022-12-12 13:39:27,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 148 transitions, 449 flow [2022-12-12 13:39:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:39:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:39:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 922 transitions. [2022-12-12 13:39:27,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8731060606060606 [2022-12-12 13:39:27,282 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2022-12-12 13:39:27,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 148 transitions, 449 flow [2022-12-12 13:39:27,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 148 transitions, 411 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-12 13:39:27,294 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 148 transitions, 411 flow [2022-12-12 13:39:27,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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-12 13:39:27,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:27,295 INFO L214 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] [2022-12-12 13:39:27,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 13:39:27,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:39:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 328701303, now seen corresponding path program 1 times [2022-12-12 13:39:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:27,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204743707] [2022-12-12 13:39:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204743707] [2022-12-12 13:39:27,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204743707] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104565884] [2022-12-12 13:39:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:27,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:27,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:27,458 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-12 13:39:27,459 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-12 13:39:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:27,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 13:39:27,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:27,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104565884] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:27,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-12 13:39:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566332799] [2022-12-12 13:39:27,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 13:39:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 13:39:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-12 13:39:27,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2022-12-12 13:39:27,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 148 transitions, 411 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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-12 13:39:27,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:27,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2022-12-12 13:39:27,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:27,894 INFO L130 PetriNetUnfolder]: 262/814 cut-off events. [2022-12-12 13:39:27,894 INFO L131 PetriNetUnfolder]: For 225/500 co-relation queries the response was YES. [2022-12-12 13:39:27,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 814 events. 262/814 cut-off events. For 225/500 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4839 event pairs, 31 based on Foata normal form. 31/750 useless extension candidates. Maximal degree in co-relation 589. Up to 115 conditions per place. [2022-12-12 13:39:27,899 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 55 selfloop transitions, 8 changer transitions 59/218 dead transitions. [2022-12-12 13:39:27,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 218 transitions, 928 flow [2022-12-12 13:39:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:39:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:39:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2022-12-12 13:39:27,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8668831168831169 [2022-12-12 13:39:27,904 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2022-12-12 13:39:27,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 218 transitions, 928 flow [2022-12-12 13:39:27,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 218 transitions, 922 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-12 13:39:27,910 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 218 transitions, 922 flow [2022-12-12 13:39:27,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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-12 13:39:27,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:27,910 INFO L214 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] [2022-12-12 13:39:27,921 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-12 13:39:28,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:28,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:39:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2098796321, now seen corresponding path program 2 times [2022-12-12 13:39:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:28,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886616806] [2022-12-12 13:39:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:28,301 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-12 13:39:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:28,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886616806] [2022-12-12 13:39:28,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886616806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:39:28,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:39:28,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 13:39:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214843816] [2022-12-12 13:39:28,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:39:28,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 13:39:28,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:28,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 13:39:28,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 13:39:28,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-12-12 13:39:28,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 218 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-12 13:39:28,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:28,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-12-12 13:39:28,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:28,424 INFO L130 PetriNetUnfolder]: 310/934 cut-off events. [2022-12-12 13:39:28,425 INFO L131 PetriNetUnfolder]: For 948/1226 co-relation queries the response was YES. [2022-12-12 13:39:28,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 934 events. 310/934 cut-off events. For 948/1226 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5306 event pairs, 35 based on Foata normal form. 21/815 useless extension candidates. Maximal degree in co-relation 1002. Up to 252 conditions per place. [2022-12-12 13:39:28,428 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 39 selfloop transitions, 7 changer transitions 58/215 dead transitions. [2022-12-12 13:39:28,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 215 transitions, 1060 flow [2022-12-12 13:39:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 13:39:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 13:39:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-12-12 13:39:28,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2022-12-12 13:39:28,431 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2022-12-12 13:39:28,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 215 transitions, 1060 flow [2022-12-12 13:39:28,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 215 transitions, 1044 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-12 13:39:28,434 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 215 transitions, 1044 flow [2022-12-12 13:39:28,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-12 13:39:28,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:28,434 INFO L214 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] [2022-12-12 13:39:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 13:39:28,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:39:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash -715351475, now seen corresponding path program 1 times [2022-12-12 13:39:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:28,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074518409] [2022-12-12 13:39:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:28,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074518409] [2022-12-12 13:39:28,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074518409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:39:28,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:39:28,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 13:39:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046993169] [2022-12-12 13:39:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:39:28,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 13:39:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 13:39:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-12 13:39:28,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 132 [2022-12-12 13:39:28,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 215 transitions, 1044 flow. Second operand has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 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-12 13:39:28,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:28,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 132 [2022-12-12 13:39:28,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:29,083 INFO L130 PetriNetUnfolder]: 580/1650 cut-off events. [2022-12-12 13:39:29,083 INFO L131 PetriNetUnfolder]: For 3245/3647 co-relation queries the response was YES. [2022-12-12 13:39:29,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 1650 events. 580/1650 cut-off events. For 3245/3647 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11440 event pairs, 100 based on Foata normal form. 66/1502 useless extension candidates. Maximal degree in co-relation 1483. Up to 425 conditions per place. [2022-12-12 13:39:29,091 INFO L137 encePairwiseOnDemand]: 122/132 looper letters, 64 selfloop transitions, 6 changer transitions 114/280 dead transitions. [2022-12-12 13:39:29,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 280 transitions, 1781 flow [2022-12-12 13:39:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 13:39:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 13:39:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1000 transitions. [2022-12-12 13:39:29,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2022-12-12 13:39:29,093 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2022-12-12 13:39:29,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 280 transitions, 1781 flow [2022-12-12 13:39:29,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 280 transitions, 1726 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-12 13:39:29,097 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 280 transitions, 1726 flow [2022-12-12 13:39:29,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 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-12 13:39:29,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:29,098 INFO L214 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] [2022-12-12 13:39:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 13:39:29,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:39:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 460410524, now seen corresponding path program 1 times [2022-12-12 13:39:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81285737] [2022-12-12 13:39:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:39:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:29,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81285737] [2022-12-12 13:39:29,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81285737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:29,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427633889] [2022-12-12 13:39:29,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:29,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:29,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:29,428 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-12 13:39:29,448 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-12 13:39:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:29,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 13:39:29,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:29,561 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-12 13:39:29,581 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-12 13:39:29,582 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 14 [2022-12-12 13:39:29,609 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-12 13:39:29,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2022-12-12 13:39:29,848 INFO L321 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-12-12 13:39:29,848 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 21 treesize of output 25 [2022-12-12 13:39:29,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12 13:39:30,223 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 6 treesize of output 5 [2022-12-12 13:39:30,297 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 6 treesize of output 5 [2022-12-12 13:39:30,350 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 6 treesize of output 5 [2022-12-12 13:39:30,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 13:39:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:30,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:30,819 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1)))))))) is different from false [2022-12-12 13:39:31,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:31,825 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 68 treesize of output 56 [2022-12-12 13:39:31,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:31,836 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 1308 treesize of output 1256 [2022-12-12 13:39:31,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:31,858 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 1244 treesize of output 1064 [2022-12-12 13:39:31,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:31,872 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 1052 treesize of output 1016 [2022-12-12 13:39:31,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:31,886 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 1004 treesize of output 920 [2022-12-12 13:39:32,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:32,496 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 68 treesize of output 56 [2022-12-12 13:39:32,507 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:32,507 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 644 treesize of output 616 [2022-12-12 13:39:32,520 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:32,521 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 612 treesize of output 568 [2022-12-12 13:39:32,534 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:32,534 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 564 treesize of output 472 [2022-12-12 13:39:32,548 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:32,549 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 353 treesize of output 333 [2022-12-12 13:39:32,553 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:39:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:33,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427633889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:33,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:33,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 24] total 52 [2022-12-12 13:39:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590656931] [2022-12-12 13:39:33,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-12 13:39:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-12 13:39:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1961, Unknown=57, NotChecked=98, Total=2652 [2022-12-12 13:39:33,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 132 [2022-12-12 13:39:33,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 280 transitions, 1726 flow. Second operand has 52 states, 52 states have (on average 56.03846153846154) internal successors, (2914), 52 states have internal predecessors, (2914), 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-12 13:39:33,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:33,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 132 [2022-12-12 13:39:33,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:33,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse12)) (.cse3 (+ c_~queue~0.offset .cse11)) (.cse15 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse11 .cse12))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse2 .cse3)) 1) (not (= (select .cse2 .cse4) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse5 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse3)))))))) (or .cse0 (let ((.cse6 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse3)))) (and (<= .cse6 1) (<= 0 .cse6))) .cse1) (or .cse0 .cse1 (let ((.cse8 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (<= (+ (select .cse7 .cse9) c_~sum~0) 1)))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse10 .cse8) 1)) (<= 0 (+ (select .cse10 .cse9) c_~sum~0)))))))) (or .cse0 (and (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse13 .cse3))) (not (= (select .cse13 .cse4) 1))))) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse14 .cse4) 1)) (<= (+ c_~sum~0 (select .cse14 .cse3)) 1))))) .cse1) (or .cse15 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse15 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse0 .cse1 (let ((.cse17 (+ .cse12 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse18 (+ .cse11 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse16 .cse17) 1)) (<= 0 (+ (select .cse16 .cse18) c_~sum~0))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse19 .cse17) 1)) (<= (+ (select .cse19 .cse18) c_~sum~0) 1))))))) (or .cse0 (let ((.cse22 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse21 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse20 .cse21))) (not (= (select .cse20 .cse22) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse23 .cse22) 1)) (<= (+ c_~sum~0 (select .cse23 .cse21)) 1)))))) .cse1) (or .cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6|) 0))) .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (= c_~sum~0 0)))) is different from false [2022-12-12 13:39:36,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse12)) (.cse3 (+ c_~queue~0.offset .cse11)) (.cse15 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse11 .cse12))) (.cse16 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6|) 0)))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse2 .cse3)) 1) (not (= (select .cse2 .cse4) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse5 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse3)))))))) (or .cse0 (let ((.cse6 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse3)))) (and (<= .cse6 1) (<= 0 .cse6))) .cse1) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (or .cse0 .cse1 (let ((.cse8 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (<= (+ (select .cse7 .cse9) c_~sum~0) 1)))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse10 .cse8) 1)) (<= 0 (+ (select .cse10 .cse9) c_~sum~0)))))))) (<= c_~v_assert~0 1) (= c_~sum~0 1) (or .cse0 (and (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse13 .cse3))) (not (= (select .cse13 .cse4) 1))))) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse14 .cse4) 1)) (<= (+ c_~sum~0 (select .cse14 .cse3)) 1))))) .cse1) (or .cse15 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse15 (< 0 c_~front~0) .cse16 .cse1) (<= 1 c_~v_assert~0) (or .cse15 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse0 .cse1 (let ((.cse18 (+ .cse12 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse19 (+ .cse11 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse17 .cse18) 1)) (<= 0 (+ (select .cse17 .cse19) c_~sum~0))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse20 .cse18) 1)) (<= (+ (select .cse20 .cse19) c_~sum~0) 1))))))) (or .cse0 (let ((.cse23 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse22 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse21 .cse22))) (not (= (select .cse21 .cse23) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse24 .cse23) 1)) (<= (+ c_~sum~0 (select .cse24 .cse22)) 1)))))) .cse1) (or .cse15 .cse16 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1)))) is different from false [2022-12-12 13:39:44,453 INFO L130 PetriNetUnfolder]: 14294/28541 cut-off events. [2022-12-12 13:39:44,454 INFO L131 PetriNetUnfolder]: For 45169/46025 co-relation queries the response was YES. [2022-12-12 13:39:44,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92929 conditions, 28541 events. 14294/28541 cut-off events. For 45169/46025 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 276977 event pairs, 1020 based on Foata normal form. 199/26144 useless extension candidates. Maximal degree in co-relation 9940. Up to 6908 conditions per place. [2022-12-12 13:39:44,583 INFO L137 encePairwiseOnDemand]: 93/132 looper letters, 595 selfloop transitions, 343 changer transitions 1103/2093 dead transitions. [2022-12-12 13:39:44,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 2093 transitions, 18323 flow [2022-12-12 13:39:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-12-12 13:39:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2022-12-12 13:39:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 6918 transitions. [2022-12-12 13:39:44,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4679383116883117 [2022-12-12 13:39:44,598 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 125 predicate places. [2022-12-12 13:39:44,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 2093 transitions, 18323 flow [2022-12-12 13:39:44,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2093 transitions, 15717 flow, removed 1278 selfloop flow, removed 12 redundant places. [2022-12-12 13:39:44,748 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 2093 transitions, 15717 flow [2022-12-12 13:39:44,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 56.03846153846154) internal successors, (2914), 52 states have internal predecessors, (2914), 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-12 13:39:44,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:44,752 INFO L214 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] [2022-12-12 13:39:44,765 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-12 13:39:44,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:44,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:39:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1225653948, now seen corresponding path program 2 times [2022-12-12 13:39:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:44,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053230245] [2022-12-12 13:39:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053230245] [2022-12-12 13:39:45,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053230245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888427938] [2022-12-12 13:39:45,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:39:45,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:45,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:45,986 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-12 13:39:45,987 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-12 13:39:46,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 13:39:46,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:39:46,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 13:39:46,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:46,602 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-12 13:39:46,926 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-12 13:39:47,007 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-12 13:39:47,137 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-12 13:39:47,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 13:39:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:47,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:47,866 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:39:47,973 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:39:48,057 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:39:48,118 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse1))) (not (= (select .cse3 .cse2) 1))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:39:48,138 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse2)))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:39:48,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:48,558 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 68 treesize of output 56 [2022-12-12 13:39:48,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:48,567 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 312 treesize of output 308 [2022-12-12 13:39:48,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:48,577 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 296 treesize of output 260 [2022-12-12 13:39:48,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:48,588 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 187 treesize of output 187 [2022-12-12 13:39:48,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:48,599 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 236 treesize of output 224 [2022-12-12 13:39:49,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:49,328 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 68 treesize of output 56 [2022-12-12 13:39:49,341 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:49,341 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 644 treesize of output 616 [2022-12-12 13:39:49,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 13:39:49,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 408 [2022-12-12 13:39:49,364 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:49,364 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 564 treesize of output 544 [2022-12-12 13:39:49,378 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:39:49,378 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 540 treesize of output 448 [2022-12-12 13:39:49,449 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:39:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 13:39:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888427938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:49,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 23] total 66 [2022-12-12 13:39:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463013883] [2022-12-12 13:39:49,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-12 13:39:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-12 13:39:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=3108, Unknown=54, NotChecked=610, Total=4290 [2022-12-12 13:39:49,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 132 [2022-12-12 13:39:49,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 2093 transitions, 15717 flow. Second operand has 66 states, 66 states have (on average 51.666666666666664) internal successors, (3410), 66 states have internal predecessors, (3410), 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-12 13:39:49,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:49,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 132 [2022-12-12 13:39:49,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:49,992 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse4 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse10 .cse9))) (.cse2 (+ c_~queue~0.offset .cse10)) (.cse0 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (or .cse0 (let ((.cse1 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse2)))) (and (<= .cse1 1) (<= 0 .cse1))) .cse3) (or .cse4 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (or .cse4 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (or .cse0 (let ((.cse6 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse5 .cse6)) 1) (not (= (select .cse5 .cse7) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse6))) (not (= (select .cse8 .cse7) 1))))))) .cse3) (= c_~sum~0 0) (or (let ((.cse12 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (not (= (select .cse11 .cse12) 1)) (<= (+ c_~sum~0 (select .cse11 .cse2)) 1)))) (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse13 .cse2))) (not (= (select .cse13 .cse12) 1))))))) .cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3)))) is different from false [2022-12-12 13:40:17,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse4 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse10 .cse9))) (.cse2 (+ c_~queue~0.offset .cse10)) (.cse0 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (or .cse0 (let ((.cse1 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse2)))) (and (<= .cse1 1) (<= 0 .cse1))) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse4 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or .cse4 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (or .cse4 (< 0 c_~front~0) .cse3) (or .cse0 (let ((.cse6 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse5 .cse6)) 1) (not (= (select .cse5 .cse7) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse6))) (not (= (select .cse8 .cse7) 1))))))) .cse3) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse12 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (not (= (select .cse11 .cse12) 1)) (<= (+ c_~sum~0 (select .cse11 .cse2)) 1)))) (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse13 .cse2))) (not (= (select .cse13 .cse12) 1))))))) .cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3)))) is different from false [2022-12-12 13:40:34,621 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 84 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:40:44,600 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 88 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:41:06,072 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 86 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:41:37,864 INFO L130 PetriNetUnfolder]: 101281/179102 cut-off events. [2022-12-12 13:41:37,864 INFO L131 PetriNetUnfolder]: For 211004/213122 co-relation queries the response was YES. [2022-12-12 13:41:38,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687523 conditions, 179102 events. 101281/179102 cut-off events. For 211004/213122 co-relation queries the response was YES. Maximal size of possible extension queue 6623. Compared 1951455 event pairs, 4524 based on Foata normal form. 234/166249 useless extension candidates. Maximal degree in co-relation 205750. Up to 48537 conditions per place. [2022-12-12 13:41:38,771 INFO L137 encePairwiseOnDemand]: 86/132 looper letters, 4619 selfloop transitions, 2900 changer transitions 9431/16991 dead transitions. [2022-12-12 13:41:38,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 16991 transitions, 157140 flow [2022-12-12 13:41:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 326 states. [2022-12-12 13:41:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2022-12-12 13:41:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 19200 transitions. [2022-12-12 13:41:38,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44617958728388174 [2022-12-12 13:41:38,795 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 438 predicate places. [2022-12-12 13:41:38,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 16991 transitions, 157140 flow [2022-12-12 13:41:39,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 16991 transitions, 136802 flow, removed 9909 selfloop flow, removed 42 redundant places. [2022-12-12 13:41:39,726 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 16991 transitions, 136802 flow [2022-12-12 13:41:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 51.666666666666664) internal successors, (3410), 66 states have internal predecessors, (3410), 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-12 13:41:39,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:41:39,727 INFO L214 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] [2022-12-12 13:41:39,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 13:41:39,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:41:39,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:41:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:41:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1796817006, now seen corresponding path program 3 times [2022-12-12 13:41:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:41:39,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490660339] [2022-12-12 13:41:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:41:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:41:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:41:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:41:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:41:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490660339] [2022-12-12 13:41:41,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490660339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:41:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864146231] [2022-12-12 13:41:41,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 13:41:41,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:41:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:41:41,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:41:41,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 13:41:41,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 13:41:41,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:41:41,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 13:41:41,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:41:41,718 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-12 13:41:42,057 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-12 13:41:42,138 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-12 13:41:42,274 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-12 13:41:42,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 13:41:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:41:42,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:41:43,066 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse1))) (not (= (select .cse3 .cse2) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:41:43,154 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ (select .cse0 .cse2) c_~sum~0))))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (<= (+ (select .cse3 .cse2) c_~sum~0) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:41:43,213 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse2)))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:41:43,411 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse2)))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:41:43,630 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse2)))))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:41:43,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:43,671 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 68 treesize of output 56 [2022-12-12 13:41:43,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:43,679 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 644 treesize of output 624 [2022-12-12 13:41:43,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:43,691 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 612 treesize of output 576 [2022-12-12 13:41:43,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:43,702 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 564 treesize of output 480 [2022-12-12 13:41:43,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:43,715 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 353 treesize of output 341 [2022-12-12 13:41:44,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:44,190 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 68 treesize of output 56 [2022-12-12 13:41:44,200 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:41:44,200 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 312 treesize of output 300 [2022-12-12 13:41:44,210 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:41:44,210 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 296 treesize of output 252 [2022-12-12 13:41:44,220 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:41:44,220 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 248 treesize of output 228 [2022-12-12 13:41:44,230 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:41:44,231 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 169 treesize of output 161 [2022-12-12 13:41:44,233 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:41:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:41:44,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864146231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:41:44,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:41:44,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 23] total 66 [2022-12-12 13:41:44,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837177535] [2022-12-12 13:41:44,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:41:44,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-12 13:41:44,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:41:44,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-12 13:41:44,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=2996, Unknown=51, NotChecked=610, Total=4290 [2022-12-12 13:41:44,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 132 [2022-12-12 13:41:44,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 16991 transitions, 136802 flow. Second operand has 66 states, 66 states have (on average 53.484848484848484) internal successors, (3530), 66 states have internal predecessors, (3530), 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-12 13:41:44,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:41:44,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 132 [2022-12-12 13:41:44,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:41:44,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~back~0 4)) (.cse8 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse8)) (.cse14 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 .cse9))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (or .cse0 (let ((.cse1 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse2)))) (and (<= .cse1 1) (<= 0 .cse1))) .cse3) (or (let ((.cse5 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse4 .cse5) 1)) (<= (+ c_~sum~0 (select .cse4 .cse6)) 1)))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse6)))))))) .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or (let ((.cse11 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse11))) (not (= (select .cse10 .cse12) 1))))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse13 .cse11)) 1) (not (= (select .cse13 .cse12) 1))))))) .cse0 .cse3) (or .cse14 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (or .cse0 (let ((.cse16 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse15 .cse16) 1)) (<= 0 (+ c_~sum~0 (select .cse15 .cse2)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse17 .cse16) 1)) (<= (+ c_~sum~0 (select .cse17 .cse2)) 1)))))) .cse3) (or .cse14 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse14 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (= c_~sum~0 0)))) is different from false [2022-12-12 13:42:01,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~back~0 4)) (.cse8 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse8)) (.cse0 (<= c_~n~0 c_~front~0)) (.cse14 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 .cse9))) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or .cse0 (let ((.cse1 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse2)))) (and (<= .cse1 1) (<= 0 .cse1))) .cse3) (<= c_~v_assert~0 1) (or (let ((.cse5 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse4 .cse5) 1)) (<= (+ c_~sum~0 (select .cse4 .cse6)) 1)))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse6)))))))) .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or (let ((.cse11 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse11))) (not (= (select .cse10 .cse12) 1))))) (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse13 .cse11)) 1) (not (= (select .cse13 .cse12) 1))))))) .cse0 .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse14 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (or .cse0 (let ((.cse16 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse15 .cse16) 1)) (<= 0 (+ c_~sum~0 (select .cse15 .cse2)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse17 .cse16) 1)) (<= (+ c_~sum~0 (select .cse17 .cse2)) 1)))))) .cse3) (or .cse14 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse14 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse3) (or .cse14 (< 0 c_~front~0) .cse3) (<= c_~sum~0 1)))) is different from false [2022-12-12 13:42:27,313 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 57 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:46:45,481 INFO L130 PetriNetUnfolder]: 200933/353607 cut-off events. [2022-12-12 13:46:45,481 INFO L131 PetriNetUnfolder]: For 344030/351302 co-relation queries the response was YES. [2022-12-12 13:46:46,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528326 conditions, 353607 events. 200933/353607 cut-off events. For 344030/351302 co-relation queries the response was YES. Maximal size of possible extension queue 11793. Compared 4116682 event pairs, 5908 based on Foata normal form. 868/329691 useless extension candidates. Maximal degree in co-relation 414888. Up to 50607 conditions per place. [2022-12-12 13:46:47,207 INFO L137 encePairwiseOnDemand]: 89/132 looper letters, 9583 selfloop transitions, 5303 changer transitions 26217/41252 dead transitions. [2022-12-12 13:46:47,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 41252 transitions, 412219 flow [2022-12-12 13:46:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-12-12 13:46:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2022-12-12 13:46:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 9100 transitions. [2022-12-12 13:46:47,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45354864433811803 [2022-12-12 13:46:47,247 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 547 predicate places. [2022-12-12 13:46:47,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 41252 transitions, 412219 flow [2022-12-12 13:46:48,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 41252 transitions, 405715 flow, removed 3049 selfloop flow, removed 51 redundant places. [2022-12-12 13:46:48,645 INFO L495 AbstractCegarLoop]: Abstraction has has 615 places, 41252 transitions, 405715 flow [2022-12-12 13:46:48,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 53.484848484848484) internal successors, (3530), 66 states have internal predecessors, (3530), 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-12 13:46:48,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:46:48,647 INFO L214 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] [2022-12-12 13:46:48,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 13:46:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:46:48,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 13:46:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:46:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1938721812, now seen corresponding path program 4 times [2022-12-12 13:46:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:46:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923224029] [2022-12-12 13:46:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:46:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:46:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:46:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:46:49,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:46:49,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923224029] [2022-12-12 13:46:49,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923224029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:46:49,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878407129] [2022-12-12 13:46:49,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 13:46:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:46:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:46:49,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:46:49,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 13:46:49,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 13:46:49,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:46:49,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-12 13:46:49,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:46:49,228 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-12 13:46:49,445 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 13:46:49,446 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 11 treesize of output 11 [2022-12-12 13:46:49,563 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-12 13:46:49,798 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-12 13:46:49,866 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-12 13:46:49,920 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 6 treesize of output 5 [2022-12-12 13:46:50,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 13:46:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:46:50,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:46:50,324 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (not (= (select .cse3 .cse2) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse1)))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:46:50,416 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:46:50,806 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:46:50,824 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:46:50,842 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse2)))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:46:50,996 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~front~0) (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse2)))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:46:51,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:46:51,024 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 68 treesize of output 56 [2022-12-12 13:46:51,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:46:51,036 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 2636 treesize of output 2520 [2022-12-12 13:46:51,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:46:51,054 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 2508 treesize of output 2328 [2022-12-12 13:46:51,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:46:51,074 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 2316 treesize of output 2232 [2022-12-12 13:46:51,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:46:51,094 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 2220 treesize of output 1848 [2022-12-12 13:46:52,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:46:52,618 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 68 treesize of output 56 [2022-12-12 13:46:52,627 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:46:52,627 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 644 treesize of output 616 [2022-12-12 13:46:52,639 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:46:52,639 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 612 treesize of output 520 [2022-12-12 13:46:52,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 13:46:52,649 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 360 [2022-12-12 13:46:52,658 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:46:52,662 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 492 treesize of output 448 [2022-12-12 13:46:52,736 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:46:53,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-12 13:46:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 13:46:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878407129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:46:53,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:46:53,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 24] total 52 [2022-12-12 13:46:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158836418] [2022-12-12 13:46:53,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:46:53,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-12 13:46:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:46:53,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-12 13:46:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1629, Unknown=18, NotChecked=558, Total=2652 [2022-12-12 13:46:53,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 132 [2022-12-12 13:46:53,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 41252 transitions, 405715 flow. Second operand has 52 states, 52 states have (on average 53.19230769230769) internal successors, (2766), 52 states have internal predecessors, (2766), 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-12 13:46:53,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:46:53,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 132 [2022-12-12 13:46:53,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:46:53,488 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13)) (.cse7 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse13 .cse4))) (.cse5 (<= c_~n~0 c_~front~0)) (.cse6 (< c_~front~0 0))) (and (or (let ((.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse1))) (not (= (select .cse3 .cse2) 1))))))) .cse5 .cse6) (or .cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15|) 0)))) .cse5 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6) (or .cse5 (let ((.cse8 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse1)))) (and (<= .cse8 1) (<= 0 .cse8))) .cse6) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (or .cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (or .cse5 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse10 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse10) 1)) (<= (+ c_~sum~0 (select .cse9 .cse11)) 1)))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse12 .cse10) 1)) (<= 0 (+ c_~sum~0 (select .cse12 .cse11)))))))) .cse6) (= c_~sum~0 0)))) is different from false [2022-12-12 13:46:57,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~back~0 4)) (.cse14 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse14)) (.cse8 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15|) 0))))) (.cse7 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse14 .cse4))) (.cse5 (<= c_~n~0 c_~front~0)) (.cse6 (< c_~front~0 0))) (and (or (let ((.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse1))) (not (= (select .cse3 .cse2) 1))))))) .cse5 .cse6) (or .cse7 .cse8 .cse5 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6) (or .cse5 (let ((.cse9 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse1)))) (and (<= .cse9 1) (<= 0 .cse9))) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (= c_~sum~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (or .cse7 .cse8 (< 0 c_~front~0) .cse6) (or .cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (or .cse5 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse11 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse10 .cse11) 1)) (<= (+ c_~sum~0 (select .cse10 .cse12)) 1)))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 .cse11) 1)) (<= 0 (+ c_~sum~0 (select .cse13 .cse12)))))))) .cse6)))) is different from false Received shutdown request... [2022-12-12 13:53:07,859 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-12 13:53:07,901 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 13:53:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-12-12 13:53:08,177 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-12 13:53:08,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 13:53:08,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:53:08,384 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 50/132 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 803774 conditions, 159311 events (88604/159310 cut-off events. For 204727/219435 co-relation queries the response was YES. Maximal size of possible extension queue 15519. Compared 1956172 event pairs, 2691 based on Foata normal form. 1498/165013 useless extension candidates. Maximal degree in co-relation 212900. Up to 30500 conditions per place.). [2022-12-12 13:53:08,387 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-12 13:53:08,387 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-12 13:53:08,387 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-12 13:53:08,387 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2022-12-12 13:53:08,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 13:53:08,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 13:53:08,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 01:53:08 BasicIcfg [2022-12-12 13:53:08,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 13:53:08,421 INFO L158 Benchmark]: Toolchain (without parser) took 823055.94ms. Allocated memory was 190.8MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 166.7MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-12 13:53:08,421 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 13:53:08,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.91ms. Allocated memory is still 190.8MB. Free memory was 166.4MB in the beginning and 152.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-12 13:53:08,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.26ms. Allocated memory is still 190.8MB. Free memory was 152.8MB in the beginning and 150.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 13:53:08,422 INFO L158 Benchmark]: Boogie Preprocessor took 38.15ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 149.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 13:53:08,422 INFO L158 Benchmark]: RCFGBuilder took 480.15ms. Allocated memory is still 190.8MB. Free memory was 149.1MB in the beginning and 127.1MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-12 13:53:08,422 INFO L158 Benchmark]: TraceAbstraction took 822289.94ms. Allocated memory was 190.8MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 126.0MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-12 13:53:08,423 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.11ms. Allocated memory is still 190.8MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.91ms. Allocated memory is still 190.8MB. Free memory was 166.4MB in the beginning and 152.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.26ms. Allocated memory is still 190.8MB. Free memory was 152.8MB in the beginning and 150.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.15ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 149.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 480.15ms. Allocated memory is still 190.8MB. Free memory was 149.1MB in the beginning and 127.1MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 822289.94ms. Allocated memory was 190.8MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 126.0MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 50/132 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 803774 conditions, 159311 events (88604/159310 cut-off events. For 204727/219435 co-relation queries the response was YES. Maximal size of possible extension queue 15519. Compared 1956172 event pairs, 2691 based on Foata normal form. 1498/165013 useless extension candidates. Maximal degree in co-relation 212900. Up to 30500 conditions per place.). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 50/132 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 803774 conditions, 159311 events (88604/159310 cut-off events. For 204727/219435 co-relation queries the response was YES. Maximal size of possible extension queue 15519. Compared 1956172 event pairs, 2691 based on Foata normal form. 1498/165013 useless extension candidates. Maximal degree in co-relation 212900. Up to 30500 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 50/132 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 803774 conditions, 159311 events (88604/159310 cut-off events. For 204727/219435 co-relation queries the response was YES. Maximal size of possible extension queue 15519. Compared 1956172 event pairs, 2691 based on Foata normal form. 1498/165013 useless extension candidates. Maximal degree in co-relation 212900. Up to 30500 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 50/132 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 803774 conditions, 159311 events (88604/159310 cut-off events. For 204727/219435 co-relation queries the response was YES. Maximal size of possible extension queue 15519. Compared 1956172 event pairs, 2691 based on Foata normal form. 1498/165013 useless extension candidates. Maximal degree in co-relation 212900. Up to 30500 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 2.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 822.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 798.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 490 mSolverCounterUnknown, 11729 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11729 mSDsluCounter, 8794 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5268 IncrementalHoareTripleChecker+Unchecked, 8433 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17874 IncrementalHoareTripleChecker+Invalid, 24375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 361 mSDtfsCounter, 17874 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1830 GetRequests, 873 SyntacticMatches, 53 SemanticMatches, 904 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 91158 ImplicationChecksByTransitivity, 119.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405715occurred in iteration=7, InterpolantAutomatonStates: 618, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 29563 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1831 ConstructedInterpolants, 153 QuantifiedInterpolants, 28369 SizeOfPredicates, 140 NumberOfNonLiveVariables, 1402 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 13/42 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