/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 15:35:33,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 15:35:33,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 15:35:33,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 15:35:33,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 15:35:33,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 15:35:33,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 15:35:33,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 15:35:33,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 15:35:33,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 15:35:33,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 15:35:33,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 15:35:33,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 15:35:33,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 15:35:33,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 15:35:33,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 15:35:33,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 15:35:33,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 15:35:33,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 15:35:33,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 15:35:33,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 15:35:33,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 15:35:33,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 15:35:33,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 15:35:33,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 15:35:33,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 15:35:33,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 15:35:33,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 15:35:33,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 15:35:33,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 15:35:33,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 15:35:33,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 15:35:33,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 15:35:33,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 15:35:33,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 15:35:33,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 15:35:33,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 15:35:33,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 15:35:33,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 15:35:33,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 15:35:33,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 15:35:33,677 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-SemanticLbe.epf [2022-12-12 15:35:33,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 15:35:33,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 15:35:33,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 15:35:33,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 15:35:33,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 15:35:33,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 15:35:33,696 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 15:35:33,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 15:35:33,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 15:35:33,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 15:35:33,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 15:35:33,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 15:35:33,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 15:35:33,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 15:35:33,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 15:35:33,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 15:35:33,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 15:35:33,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 15:35:33,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 15:35:33,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 15:35:33,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 15:35:33,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 15:35:33,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 15:35:33,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 15:35:33,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 15:35:33,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 15:35:33,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 15:35:33,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 15:35:33,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 15:35:33,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 15:35:33,700 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 [2022-12-12 15:35:33,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 15:35:33,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 15:35:33,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 15:35:33,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 15:35:33,979 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 15:35:33,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-12 15:35:34,886 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 15:35:35,091 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 15:35:35,092 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-12 15:35:35,125 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32522ea34/0b8c768a04414100afce60192b543dfd/FLAG31557b255 [2022-12-12 15:35:35,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32522ea34/0b8c768a04414100afce60192b543dfd [2022-12-12 15:35:35,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 15:35:35,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 15:35:35,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 15:35:35,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 15:35:35,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 15:35:35,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8b0727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35, skipping insertion in model container [2022-12-12 15:35:35,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 15:35:35,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 15:35:35,268 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/parallel-misc-1.wvr.c[2755,2768] [2022-12-12 15:35:35,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 15:35:35,280 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 15:35:35,294 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/parallel-misc-1.wvr.c[2755,2768] [2022-12-12 15:35:35,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 15:35:35,306 INFO L208 MainTranslator]: Completed translation [2022-12-12 15:35:35,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35 WrapperNode [2022-12-12 15:35:35,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 15:35:35,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 15:35:35,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 15:35:35,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 15:35:35,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,363 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-12-12 15:35:35,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 15:35:35,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 15:35:35,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 15:35:35,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 15:35:35,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 15:35:35,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 15:35:35,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 15:35:35,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 15:35:35,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (1/1) ... [2022-12-12 15:35:35,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 15:35:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:35,436 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 15:35:35,455 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 15:35:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 15:35:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 15:35:35,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 15:35:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 15:35:35,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 15:35:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 15:35:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 15:35:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 15:35:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 15:35:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 15:35:35,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 15:35:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 15:35:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 15:35:35,469 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 15:35:35,606 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 15:35:35,607 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 15:35:35,928 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 15:35:35,938 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 15:35:35,938 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 15:35:35,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 03:35:35 BoogieIcfgContainer [2022-12-12 15:35:35,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 15:35:35,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 15:35:35,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 15:35:35,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 15:35:35,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 03:35:35" (1/3) ... [2022-12-12 15:35:35,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb278aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 03:35:35, skipping insertion in model container [2022-12-12 15:35:35,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:35:35" (2/3) ... [2022-12-12 15:35:35,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb278aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 03:35:35, skipping insertion in model container [2022-12-12 15:35:35,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 03:35:35" (3/3) ... [2022-12-12 15:35:35,962 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-12 15:35:35,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 15:35:35,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 15:35:35,977 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 15:35:36,072 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 15:35:36,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 688 flow [2022-12-12 15:35:36,238 INFO L130 PetriNetUnfolder]: 28/334 cut-off events. [2022-12-12 15:35:36,239 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 15:35:36,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 334 events. 28/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 760 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-12 15:35:36,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 336 transitions, 688 flow [2022-12-12 15:35:36,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 326 transitions, 664 flow [2022-12-12 15:35:36,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 15:35:36,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-12 15:35:36,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 326 transitions, 664 flow [2022-12-12 15:35:36,361 INFO L130 PetriNetUnfolder]: 28/326 cut-off events. [2022-12-12 15:35:36,362 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 15:35:36,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 326 events. 28/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 759 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-12 15:35:36,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-12 15:35:36,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 25652 [2022-12-12 15:35:45,992 INFO L241 LiptonReduction]: Total number of compositions: 310 [2022-12-12 15:35:46,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 15:35:46,023 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;@38f2dbf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 15:35:46,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 15:35:46,030 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-12 15:35:46,030 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 15:35:46,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:46,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:46,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -156050190, now seen corresponding path program 1 times [2022-12-12 15:35:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:46,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826291303] [2022-12-12 15:35:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:46,645 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 15:35:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:46,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826291303] [2022-12-12 15:35:46,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826291303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:35:46,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:35:46,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 15:35:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806905905] [2022-12-12 15:35:46,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:35:46,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 15:35:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:46,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 15:35:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 15:35:46,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:46,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15:35:46,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:46,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:46,816 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2022-12-12 15:35:46,817 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-12 15:35:46,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2022-12-12 15:35:46,819 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2022-12-12 15:35:46,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2022-12-12 15:35:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 15:35:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 15:35:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-12 15:35:46,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-12 15:35:46,829 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 5 states and 44 transitions. [2022-12-12 15:35:46,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 43 transitions, 199 flow [2022-12-12 15:35:46,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-12 15:35:46,833 INFO L231 Difference]: Finished difference. Result has 23 places, 25 transitions, 99 flow [2022-12-12 15:35:46,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=23, PETRI_TRANSITIONS=25} [2022-12-12 15:35:46,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-12 15:35:46,837 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 25 transitions, 99 flow [2022-12-12 15:35:46,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15:35:46,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:46,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:46,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 15:35:46,838 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1029066208, now seen corresponding path program 1 times [2022-12-12 15:35:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:46,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132829329] [2022-12-12 15:35:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:46,964 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 15:35:46,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:46,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132829329] [2022-12-12 15:35:46,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132829329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:35:46,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:35:46,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 15:35:46,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13096209] [2022-12-12 15:35:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:35:46,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 15:35:46,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:46,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 15:35:46,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 15:35:46,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:46,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15:35:46,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:46,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:46,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:47,052 INFO L130 PetriNetUnfolder]: 109/196 cut-off events. [2022-12-12 15:35:47,053 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-12 15:35:47,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 196 events. 109/196 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 630 event pairs, 17 based on Foata normal form. 8/196 useless extension candidates. Maximal degree in co-relation 258. Up to 69 conditions per place. [2022-12-12 15:35:47,054 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2022-12-12 15:35:47,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 54 transitions, 307 flow [2022-12-12 15:35:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 15:35:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 15:35:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-12 15:35:47,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-12 15:35:47,055 INFO L175 Difference]: Start difference. First operand has 23 places, 25 transitions, 99 flow. Second operand 5 states and 42 transitions. [2022-12-12 15:35:47,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 54 transitions, 307 flow [2022-12-12 15:35:47,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 54 transitions, 305 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 15:35:47,057 INFO L231 Difference]: Finished difference. Result has 30 places, 34 transitions, 205 flow [2022-12-12 15:35:47,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=30, PETRI_TRANSITIONS=34} [2022-12-12 15:35:47,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-12 15:35:47,058 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 34 transitions, 205 flow [2022-12-12 15:35:47,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15:35:47,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:47,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:47,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 15:35:47,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:47,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1373844080, now seen corresponding path program 2 times [2022-12-12 15:35:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:47,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733763066] [2022-12-12 15:35:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:47,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:47,191 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 15:35:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:47,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733763066] [2022-12-12 15:35:47,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733763066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:35:47,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:35:47,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 15:35:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228514610] [2022-12-12 15:35:47,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:35:47,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 15:35:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:47,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 15:35:47,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 15:35:47,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:47,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15:35:47,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:47,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:47,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:47,279 INFO L130 PetriNetUnfolder]: 169/319 cut-off events. [2022-12-12 15:35:47,279 INFO L131 PetriNetUnfolder]: For 585/585 co-relation queries the response was YES. [2022-12-12 15:35:47,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 319 events. 169/319 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1228 event pairs, 67 based on Foata normal form. 16/335 useless extension candidates. Maximal degree in co-relation 612. Up to 122 conditions per place. [2022-12-12 15:35:47,281 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 55 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2022-12-12 15:35:47,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 66 transitions, 514 flow [2022-12-12 15:35:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 15:35:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 15:35:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-12 15:35:47,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-12 15:35:47,283 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 205 flow. Second operand 5 states and 37 transitions. [2022-12-12 15:35:47,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 66 transitions, 514 flow [2022-12-12 15:35:47,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 502 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-12 15:35:47,286 INFO L231 Difference]: Finished difference. Result has 37 places, 39 transitions, 278 flow [2022-12-12 15:35:47,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=37, PETRI_TRANSITIONS=39} [2022-12-12 15:35:47,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-12 15:35:47,287 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 278 flow [2022-12-12 15:35:47,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15:35:47,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:47,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:47,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 15:35:47,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -272879849, now seen corresponding path program 1 times [2022-12-12 15:35:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:47,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056160107] [2022-12-12 15:35:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:47,397 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 15:35:47,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:47,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056160107] [2022-12-12 15:35:47,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056160107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:35:47,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:35:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 15:35:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146972882] [2022-12-12 15:35:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:35:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 15:35:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 15:35:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 15:35:47,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:47,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 15:35:47,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:47,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:47,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:47,466 INFO L130 PetriNetUnfolder]: 114/220 cut-off events. [2022-12-12 15:35:47,466 INFO L131 PetriNetUnfolder]: For 432/432 co-relation queries the response was YES. [2022-12-12 15:35:47,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 220 events. 114/220 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 741 event pairs, 46 based on Foata normal form. 6/226 useless extension candidates. Maximal degree in co-relation 803. Up to 123 conditions per place. [2022-12-12 15:35:47,468 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 35 selfloop transitions, 5 changer transitions 11/51 dead transitions. [2022-12-12 15:35:47,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 416 flow [2022-12-12 15:35:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 15:35:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 15:35:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-12 15:35:47,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-12 15:35:47,469 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 278 flow. Second operand 5 states and 33 transitions. [2022-12-12 15:35:47,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 416 flow [2022-12-12 15:35:47,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 406 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-12 15:35:47,471 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 243 flow [2022-12-12 15:35:47,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-12 15:35:47,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-12 15:35:47,472 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 243 flow [2022-12-12 15:35:47,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 15:35:47,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:47,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:47,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 15:35:47,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -656950796, now seen corresponding path program 1 times [2022-12-12 15:35:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:47,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153857914] [2022-12-12 15:35:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:35:47,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:47,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153857914] [2022-12-12 15:35:47,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153857914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:47,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291917115] [2022-12-12 15:35:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:47,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:47,645 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 15:35:47,676 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 15:35:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:47,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 15:35:47,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:35:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:35:47,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:35:47,873 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 15:35:47,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291917115] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:47,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 15:35:47,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-12 15:35:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917110882] [2022-12-12 15:35:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:35:47,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 15:35:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 15:35:47,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 15:35:47,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:47,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 15:35:47,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:47,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:47,940 INFO L130 PetriNetUnfolder]: 90/153 cut-off events. [2022-12-12 15:35:47,940 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-12 15:35:47,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 153 events. 90/153 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 406 event pairs, 28 based on Foata normal form. 12/165 useless extension candidates. Maximal degree in co-relation 645. Up to 80 conditions per place. [2022-12-12 15:35:47,941 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 27 selfloop transitions, 13 changer transitions 0/40 dead transitions. [2022-12-12 15:35:47,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 339 flow [2022-12-12 15:35:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 15:35:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 15:35:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-12-12 15:35:47,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-12 15:35:47,943 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 243 flow. Second operand 5 states and 24 transitions. [2022-12-12 15:35:47,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 339 flow [2022-12-12 15:35:47,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 303 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-12 15:35:47,946 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 241 flow [2022-12-12 15:35:47,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-12 15:35:47,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-12 15:35:47,947 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 241 flow [2022-12-12 15:35:47,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 15:35:47,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:47,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:47,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 15:35:48,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:48,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1935798551, now seen corresponding path program 1 times [2022-12-12 15:35:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:48,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475759712] [2022-12-12 15:35:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:48,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:48,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:48,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475759712] [2022-12-12 15:35:48,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475759712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:48,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768928907] [2022-12-12 15:35:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:48,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:48,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:48,320 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 15:35:48,347 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 15:35:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:48,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 15:35:48,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:35:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:48,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:35:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:48,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768928907] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:48,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 15:35:48,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2022-12-12 15:35:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135084752] [2022-12-12 15:35:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:35:48,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 15:35:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:48,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 15:35:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 15:35:48,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:48,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15:35:48,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:48,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:48,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:48,578 INFO L130 PetriNetUnfolder]: 99/166 cut-off events. [2022-12-12 15:35:48,579 INFO L131 PetriNetUnfolder]: For 410/410 co-relation queries the response was YES. [2022-12-12 15:35:48,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 166 events. 99/166 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 420 event pairs, 18 based on Foata normal form. 16/182 useless extension candidates. Maximal degree in co-relation 712. Up to 108 conditions per place. [2022-12-12 15:35:48,580 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 36 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2022-12-12 15:35:48,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 369 flow [2022-12-12 15:35:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 15:35:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 15:35:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-12-12 15:35:48,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-12 15:35:48,581 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 241 flow. Second operand 5 states and 25 transitions. [2022-12-12 15:35:48,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 369 flow [2022-12-12 15:35:48,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 342 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-12 15:35:48,583 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 232 flow [2022-12-12 15:35:48,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-12 15:35:48,585 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-12 15:35:48,585 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 232 flow [2022-12-12 15:35:48,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15:35:48,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:48,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:48,592 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 15:35:48,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-12 15:35:48,790 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1547602239, now seen corresponding path program 1 times [2022-12-12 15:35:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:48,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687835362] [2022-12-12 15:35:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:50,316 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 15:35:50,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:50,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687835362] [2022-12-12 15:35:50,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687835362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:50,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43943384] [2022-12-12 15:35:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:50,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:50,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:50,318 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 15:35:50,320 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 15:35:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:50,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-12 15:35:50,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:35:50,819 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 217 treesize of output 185 [2022-12-12 15:35:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:50,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:35:51,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:35:51,469 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 302 treesize of output 266 [2022-12-12 15:35:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43943384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:35:51,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:35:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2022-12-12 15:35:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557633352] [2022-12-12 15:35:51,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:35:51,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 15:35:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 15:35:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-12 15:35:51,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:51,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 232 flow. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 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 15:35:51,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:51,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:51,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:52,391 INFO L130 PetriNetUnfolder]: 265/451 cut-off events. [2022-12-12 15:35:52,391 INFO L131 PetriNetUnfolder]: For 941/941 co-relation queries the response was YES. [2022-12-12 15:35:52,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 451 events. 265/451 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1689 event pairs, 0 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 1506. Up to 173 conditions per place. [2022-12-12 15:35:52,394 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 90 selfloop transitions, 49 changer transitions 8/147 dead transitions. [2022-12-12 15:35:52,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 147 transitions, 1147 flow [2022-12-12 15:35:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 15:35:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 15:35:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-12-12 15:35:52,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3980263157894737 [2022-12-12 15:35:52,398 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 232 flow. Second operand 19 states and 121 transitions. [2022-12-12 15:35:52,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 147 transitions, 1147 flow [2022-12-12 15:35:52,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 147 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 15:35:52,403 INFO L231 Difference]: Finished difference. Result has 69 places, 76 transitions, 769 flow [2022-12-12 15:35:52,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=769, PETRI_PLACES=69, PETRI_TRANSITIONS=76} [2022-12-12 15:35:52,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 49 predicate places. [2022-12-12 15:35:52,405 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 76 transitions, 769 flow [2022-12-12 15:35:52,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 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 15:35:52,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:52,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:52,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 15:35:52,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:52,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1700152309, now seen corresponding path program 2 times [2022-12-12 15:35:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:52,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231610405] [2022-12-12 15:35:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:53,836 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 15:35:53,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:53,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231610405] [2022-12-12 15:35:53,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231610405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:53,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219939580] [2022-12-12 15:35:53,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 15:35:53,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:53,839 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 15:35:53,871 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 15:35:53,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:35:53,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:35:53,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-12 15:35:53,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:35:54,120 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 185 treesize of output 157 [2022-12-12 15:35:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:54,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:35:54,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:35:54,516 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 302 treesize of output 266 [2022-12-12 15:35:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:54,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219939580] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:35:54,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:35:54,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-12-12 15:35:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455709969] [2022-12-12 15:35:54,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:35:54,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-12 15:35:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-12 15:35:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-12-12 15:35:54,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:54,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 76 transitions, 769 flow. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 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 15:35:54,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:54,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:55,279 INFO L130 PetriNetUnfolder]: 295/504 cut-off events. [2022-12-12 15:35:55,279 INFO L131 PetriNetUnfolder]: For 2313/2313 co-relation queries the response was YES. [2022-12-12 15:35:55,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2925 conditions, 504 events. 295/504 cut-off events. For 2313/2313 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1985 event pairs, 8 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 2649. Up to 189 conditions per place. [2022-12-12 15:35:55,283 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 87 selfloop transitions, 58 changer transitions 8/153 dead transitions. [2022-12-12 15:35:55,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 153 transitions, 1619 flow [2022-12-12 15:35:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 15:35:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 15:35:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2022-12-12 15:35:55,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-12 15:35:55,285 INFO L175 Difference]: Start difference. First operand has 69 places, 76 transitions, 769 flow. Second operand 19 states and 120 transitions. [2022-12-12 15:35:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 153 transitions, 1619 flow [2022-12-12 15:35:55,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 153 transitions, 1505 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-12 15:35:55,299 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 1050 flow [2022-12-12 15:35:55,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1050, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2022-12-12 15:35:55,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2022-12-12 15:35:55,301 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 1050 flow [2022-12-12 15:35:55,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 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 15:35:55,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:55,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:55,310 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 15:35:55,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:55,506 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1398965299, now seen corresponding path program 3 times [2022-12-12 15:35:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:55,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439188876] [2022-12-12 15:35:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:56,321 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 15:35:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:56,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439188876] [2022-12-12 15:35:56,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439188876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:56,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838651723] [2022-12-12 15:35:56,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 15:35:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:56,329 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 15:35:56,331 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 15:35:56,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 15:35:56,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:35:56,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-12 15:35:56,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:35:56,608 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 185 treesize of output 157 [2022-12-12 15:35:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:56,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:35:56,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:35:56,960 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 302 treesize of output 266 [2022-12-12 15:35:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:35:57,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838651723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:35:57,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:35:57,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-12 15:35:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455297793] [2022-12-12 15:35:57,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:35:57,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 15:35:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:35:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 15:35:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-12-12 15:35:57,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:35:57,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 1050 flow. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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 15:35:57,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:35:57,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:35:57,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:35:58,278 INFO L130 PetriNetUnfolder]: 353/602 cut-off events. [2022-12-12 15:35:58,279 INFO L131 PetriNetUnfolder]: For 3688/3688 co-relation queries the response was YES. [2022-12-12 15:35:58,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 602 events. 353/602 cut-off events. For 3688/3688 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2495 event pairs, 4 based on Foata normal form. 2/604 useless extension candidates. Maximal degree in co-relation 3360. Up to 209 conditions per place. [2022-12-12 15:35:58,284 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 103 selfloop transitions, 108 changer transitions 8/219 dead transitions. [2022-12-12 15:35:58,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 219 transitions, 2430 flow [2022-12-12 15:35:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-12 15:35:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-12 15:35:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 178 transitions. [2022-12-12 15:35:58,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2022-12-12 15:35:58,286 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 1050 flow. Second operand 33 states and 178 transitions. [2022-12-12 15:35:58,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 219 transitions, 2430 flow [2022-12-12 15:35:58,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 219 transitions, 2285 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-12-12 15:35:58,299 INFO L231 Difference]: Finished difference. Result has 123 places, 144 transitions, 1878 flow [2022-12-12 15:35:58,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1878, PETRI_PLACES=123, PETRI_TRANSITIONS=144} [2022-12-12 15:35:58,300 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 103 predicate places. [2022-12-12 15:35:58,300 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 144 transitions, 1878 flow [2022-12-12 15:35:58,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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 15:35:58,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:35:58,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:35:58,308 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 15:35:58,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:58,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:35:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:35:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1704314831, now seen corresponding path program 4 times [2022-12-12 15:35:58,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:35:58,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656361418] [2022-12-12 15:35:58,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:35:58,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:35:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:35:59,953 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 15:35:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:35:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656361418] [2022-12-12 15:35:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656361418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:35:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278664181] [2022-12-12 15:35:59,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 15:35:59,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:35:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:35:59,955 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:35:59,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 15:36:00,029 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 15:36:00,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:00,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-12 15:36:00,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:00,080 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 11 treesize of output 7 [2022-12-12 15:36:00,125 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 15:36:00,189 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 15:36:00,458 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 173 treesize of output 153 [2022-12-12 15:36:00,505 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 15:36:00,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:01,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278664181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:01,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:01,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-12 15:36:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240821120] [2022-12-12 15:36:01,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:01,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-12 15:36:01,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:01,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-12 15:36:01,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=462, Unknown=3, NotChecked=0, Total=552 [2022-12-12 15:36:01,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:01,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 144 transitions, 1878 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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 15:36:01,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:01,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:01,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:11,136 INFO L130 PetriNetUnfolder]: 448/810 cut-off events. [2022-12-12 15:36:11,137 INFO L131 PetriNetUnfolder]: For 7869/7869 co-relation queries the response was YES. [2022-12-12 15:36:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5733 conditions, 810 events. 448/810 cut-off events. For 7869/7869 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3941 event pairs, 0 based on Foata normal form. 6/816 useless extension candidates. Maximal degree in co-relation 5444. Up to 256 conditions per place. [2022-12-12 15:36:11,144 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 136 selfloop transitions, 194 changer transitions 12/342 dead transitions. [2022-12-12 15:36:11,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 342 transitions, 4383 flow [2022-12-12 15:36:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-12 15:36:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-12 15:36:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 243 transitions. [2022-12-12 15:36:11,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30375 [2022-12-12 15:36:11,147 INFO L175 Difference]: Start difference. First operand has 123 places, 144 transitions, 1878 flow. Second operand 50 states and 243 transitions. [2022-12-12 15:36:11,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 342 transitions, 4383 flow [2022-12-12 15:36:11,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 342 transitions, 3919 flow, removed 133 selfloop flow, removed 20 redundant places. [2022-12-12 15:36:11,177 INFO L231 Difference]: Finished difference. Result has 160 places, 232 transitions, 3411 flow [2022-12-12 15:36:11,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=3411, PETRI_PLACES=160, PETRI_TRANSITIONS=232} [2022-12-12 15:36:11,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 140 predicate places. [2022-12-12 15:36:11,177 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 232 transitions, 3411 flow [2022-12-12 15:36:11,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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 15:36:11,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:11,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:11,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:11,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:11,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 538065625, now seen corresponding path program 5 times [2022-12-12 15:36:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:11,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139140210] [2022-12-12 15:36:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:12,323 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 15:36:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:12,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139140210] [2022-12-12 15:36:12,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139140210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:12,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842926021] [2022-12-12 15:36:12,323 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 15:36:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:12,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:12,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:12,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 15:36:12,411 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:36:12,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:12,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 15:36:12,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:12,440 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 11 treesize of output 7 [2022-12-12 15:36:12,477 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 15:36:12,523 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 15:36:12,684 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 169 treesize of output 151 [2022-12-12 15:36:12,793 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 15:36:12,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:13,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842926021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:13,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:13,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2022-12-12 15:36:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382414217] [2022-12-12 15:36:13,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:13,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-12 15:36:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-12 15:36:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=379, Unknown=8, NotChecked=0, Total=462 [2022-12-12 15:36:13,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:13,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 232 transitions, 3411 flow. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 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 15:36:13,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:13,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:14,830 INFO L130 PetriNetUnfolder]: 448/808 cut-off events. [2022-12-12 15:36:14,830 INFO L131 PetriNetUnfolder]: For 7931/7931 co-relation queries the response was YES. [2022-12-12 15:36:14,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 808 events. 448/808 cut-off events. For 7931/7931 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3927 event pairs, 14 based on Foata normal form. 2/810 useless extension candidates. Maximal degree in co-relation 5930. Up to 286 conditions per place. [2022-12-12 15:36:14,838 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 124 selfloop transitions, 159 changer transitions 8/291 dead transitions. [2022-12-12 15:36:14,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 291 transitions, 4300 flow [2022-12-12 15:36:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-12 15:36:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-12 15:36:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 152 transitions. [2022-12-12 15:36:14,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-12 15:36:14,840 INFO L175 Difference]: Start difference. First operand has 160 places, 232 transitions, 3411 flow. Second operand 27 states and 152 transitions. [2022-12-12 15:36:14,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 291 transitions, 4300 flow [2022-12-12 15:36:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 291 transitions, 3555 flow, removed 306 selfloop flow, removed 16 redundant places. [2022-12-12 15:36:14,889 INFO L231 Difference]: Finished difference. Result has 172 places, 237 transitions, 3184 flow [2022-12-12 15:36:14,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3184, PETRI_PLACES=172, PETRI_TRANSITIONS=237} [2022-12-12 15:36:14,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 152 predicate places. [2022-12-12 15:36:14,890 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 237 transitions, 3184 flow [2022-12-12 15:36:14,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 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 15:36:14,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:14,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:14,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:15,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash 844845655, now seen corresponding path program 6 times [2022-12-12 15:36:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779550557] [2022-12-12 15:36:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:16,003 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 15:36:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:16,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779550557] [2022-12-12 15:36:16,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779550557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:16,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906479029] [2022-12-12 15:36:16,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 15:36:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:16,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:16,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 15:36:16,088 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 15:36:16,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:16,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-12 15:36:16,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:16,331 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 157 treesize of output 145 [2022-12-12 15:36:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:16,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:16,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:36:16,830 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 177 treesize of output 93 [2022-12-12 15:36:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:16,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906479029] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:16,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:16,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-12-12 15:36:16,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063722051] [2022-12-12 15:36:16,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:16,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-12 15:36:16,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:16,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-12 15:36:16,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-12-12 15:36:16,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:17,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 237 transitions, 3184 flow. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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 15:36:17,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:17,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:17,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:17,756 INFO L130 PetriNetUnfolder]: 483/865 cut-off events. [2022-12-12 15:36:17,756 INFO L131 PetriNetUnfolder]: For 4166/4166 co-relation queries the response was YES. [2022-12-12 15:36:17,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5980 conditions, 865 events. 483/865 cut-off events. For 4166/4166 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4294 event pairs, 20 based on Foata normal form. 2/867 useless extension candidates. Maximal degree in co-relation 5857. Up to 357 conditions per place. [2022-12-12 15:36:17,764 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 205 selfloop transitions, 89 changer transitions 10/304 dead transitions. [2022-12-12 15:36:17,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 304 transitions, 4330 flow [2022-12-12 15:36:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-12 15:36:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-12 15:36:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-12-12 15:36:17,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.358695652173913 [2022-12-12 15:36:17,765 INFO L175 Difference]: Start difference. First operand has 172 places, 237 transitions, 3184 flow. Second operand 23 states and 132 transitions. [2022-12-12 15:36:17,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 304 transitions, 4330 flow [2022-12-12 15:36:17,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 304 transitions, 4101 flow, removed 40 selfloop flow, removed 16 redundant places. [2022-12-12 15:36:17,799 INFO L231 Difference]: Finished difference. Result has 182 places, 256 transitions, 3476 flow [2022-12-12 15:36:17,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2988, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3476, PETRI_PLACES=182, PETRI_TRANSITIONS=256} [2022-12-12 15:36:17,800 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 162 predicate places. [2022-12-12 15:36:17,800 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 256 transitions, 3476 flow [2022-12-12 15:36:17,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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 15:36:17,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:17,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:17,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:18,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 15:36:18,006 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1804957205, now seen corresponding path program 7 times [2022-12-12 15:36:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:18,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359379144] [2022-12-12 15:36:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:18,807 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 15:36:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359379144] [2022-12-12 15:36:18,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359379144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318804779] [2022-12-12 15:36:18,808 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 15:36:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:18,809 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:18,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 15:36:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:18,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-12 15:36:18,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:19,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 15:36:19,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-12 15:36:19,158 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 185 treesize of output 157 [2022-12-12 15:36:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:19,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:19,436 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_331) c_~A~0.base) .cse1))) (or (<= c_~sum1~0 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_331) c_~A~0.base) .cse1))) (or (<= (+ c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647))))))) is different from false [2022-12-12 15:36:19,456 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_331) c_~A~0.base) .cse2))) (or (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_331) c_~A~0.base) .cse2))) (or (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-12-12 15:36:19,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:36:19,535 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 469 treesize of output 417 [2022-12-12 15:36:19,545 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 181 treesize of output 163 [2022-12-12 15:36:19,555 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 163 treesize of output 145 [2022-12-12 15:36:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-12 15:36:19,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318804779] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:19,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:19,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-12-12 15:36:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511153294] [2022-12-12 15:36:19,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:19,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-12 15:36:19,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:19,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-12 15:36:19,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=353, Unknown=2, NotChecked=78, Total=506 [2022-12-12 15:36:19,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:19,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 256 transitions, 3476 flow. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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 15:36:19,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:19,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:20,824 INFO L130 PetriNetUnfolder]: 495/895 cut-off events. [2022-12-12 15:36:20,824 INFO L131 PetriNetUnfolder]: For 4338/4338 co-relation queries the response was YES. [2022-12-12 15:36:20,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6202 conditions, 895 events. 495/895 cut-off events. For 4338/4338 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4564 event pairs, 10 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 6067. Up to 335 conditions per place. [2022-12-12 15:36:20,832 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 197 selfloop transitions, 100 changer transitions 8/305 dead transitions. [2022-12-12 15:36:20,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 305 transitions, 4315 flow [2022-12-12 15:36:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 15:36:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 15:36:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2022-12-12 15:36:20,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-12 15:36:20,834 INFO L175 Difference]: Start difference. First operand has 182 places, 256 transitions, 3476 flow. Second operand 17 states and 108 transitions. [2022-12-12 15:36:20,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 305 transitions, 4315 flow [2022-12-12 15:36:20,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 305 transitions, 4168 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-12-12 15:36:20,868 INFO L231 Difference]: Finished difference. Result has 190 places, 260 transitions, 3676 flow [2022-12-12 15:36:20,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=3335, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3676, PETRI_PLACES=190, PETRI_TRANSITIONS=260} [2022-12-12 15:36:20,869 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 170 predicate places. [2022-12-12 15:36:20,869 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 260 transitions, 3676 flow [2022-12-12 15:36:20,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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 15:36:20,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:20,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:20,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:21,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-12 15:36:21,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 367368165, now seen corresponding path program 8 times [2022-12-12 15:36:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:21,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427378265] [2022-12-12 15:36:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:22,205 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 15:36:22,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:22,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427378265] [2022-12-12 15:36:22,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427378265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:22,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398668906] [2022-12-12 15:36:22,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 15:36:22,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:22,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:22,216 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:22,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 15:36:22,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:36:22,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:22,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 15:36:22,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:22,332 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 11 treesize of output 7 [2022-12-12 15:36:22,367 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 15:36:22,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 15:36:22,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-12 15:36:22,535 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 185 treesize of output 157 [2022-12-12 15:36:22,631 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 15:36:22,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:22,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_365 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) c_~A~0.base) .cse2))) (or (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= (+ .cse0 c_~bag2~0 c_~sum2~0) .cse1) (not (<= (+ .cse0 c_~bag2~0) 2147483647))))) (forall ((v_ArrVal_365 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) c_~A~0.base) .cse2))) (or (not (<= 0 (+ .cse3 c_~bag2~0 2147483648))) (<= .cse1 (+ .cse3 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse3 c_~bag2~0) 2147483647))))))) is different from false [2022-12-12 15:36:23,167 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (<= .cse0 2147483647)))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_365 (Array Int Int))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse2 .cse3) (not (<= .cse2 2147483647))))) (not (<= 0 (+ .cse3 2147483648))) (not (<= .cse3 2147483647)))))) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse5 2147483648))) (<= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse5) (not (<= .cse5 2147483647)))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse7 2147483648))) (forall ((v_ArrVal_365 (Array Int Int))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse8 2147483648))) (<= .cse7 .cse8)))) (not (<= .cse7 2147483647))))))) is different from false [2022-12-12 15:36:23,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:36:23,186 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 99 treesize of output 63 [2022-12-12 15:36:23,190 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 506 treesize of output 458 [2022-12-12 15:36:23,201 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 320 treesize of output 306 [2022-12-12 15:36:23,206 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 306 treesize of output 280 [2022-12-12 15:36:23,257 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:36:23,258 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 15:36:23,262 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:36:23,262 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2022-12-12 15:36:23,267 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:36:23,269 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2022-12-12 15:36:23,282 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 15:36:23,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398668906] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:23,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:23,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-12 15:36:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834013784] [2022-12-12 15:36:23,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:23,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-12 15:36:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-12 15:36:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=385, Unknown=2, NotChecked=82, Total=552 [2022-12-12 15:36:23,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:23,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 260 transitions, 3676 flow. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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 15:36:23,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:23,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:23,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:24,371 INFO L130 PetriNetUnfolder]: 527/977 cut-off events. [2022-12-12 15:36:24,371 INFO L131 PetriNetUnfolder]: For 4925/4925 co-relation queries the response was YES. [2022-12-12 15:36:24,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 977 events. 527/977 cut-off events. For 4925/4925 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5148 event pairs, 15 based on Foata normal form. 2/979 useless extension candidates. Maximal degree in co-relation 6785. Up to 536 conditions per place. [2022-12-12 15:36:24,380 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 176 selfloop transitions, 138 changer transitions 8/322 dead transitions. [2022-12-12 15:36:24,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 322 transitions, 4827 flow [2022-12-12 15:36:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 15:36:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 15:36:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 115 transitions. [2022-12-12 15:36:24,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3782894736842105 [2022-12-12 15:36:24,381 INFO L175 Difference]: Start difference. First operand has 190 places, 260 transitions, 3676 flow. Second operand 19 states and 115 transitions. [2022-12-12 15:36:24,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 322 transitions, 4827 flow [2022-12-12 15:36:24,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 322 transitions, 4606 flow, removed 18 selfloop flow, removed 14 redundant places. [2022-12-12 15:36:24,423 INFO L231 Difference]: Finished difference. Result has 199 places, 269 transitions, 3975 flow [2022-12-12 15:36:24,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=3461, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3975, PETRI_PLACES=199, PETRI_TRANSITIONS=269} [2022-12-12 15:36:24,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 179 predicate places. [2022-12-12 15:36:24,424 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 269 transitions, 3975 flow [2022-12-12 15:36:24,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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 15:36:24,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:24,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:24,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:24,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-12 15:36:24,630 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1043184533, now seen corresponding path program 9 times [2022-12-12 15:36:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:24,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742206935] [2022-12-12 15:36:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:25,377 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 15:36:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:25,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742206935] [2022-12-12 15:36:25,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742206935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:25,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674172294] [2022-12-12 15:36:25,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 15:36:25,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:25,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:25,378 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:25,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-12 15:36:25,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 15:36:25,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:25,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-12 15:36:25,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:25,489 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 11 treesize of output 7 [2022-12-12 15:36:25,526 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 15:36:25,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 15:36:25,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 15:36:25,776 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 179 treesize of output 151 [2022-12-12 15:36:25,853 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 15:36:25,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:26,247 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (let ((.cse3 (+ c_~bag1~0 c_~sum1~0 .cse1)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) c_~A~0.base) .cse4))) (or (<= (+ .cse2 c_~bag2~0 c_~sum2~0) .cse3) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647))))) (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) c_~A~0.base) .cse4))) (or (<= .cse3 (+ .cse5 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (not (<= (+ .cse5 c_~bag2~0) 2147483647))))))))) (and (or .cse0 (not (<= (+ c_~bag1~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse1 2147483648)))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) (not (< c_~j~0 c_~N~0))) is different from false [2022-12-12 15:36:26,464 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 0 c_~N~0)) (and (forall ((v_ArrVal_398 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_398))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (not (<= 0 (+ .cse0 2147483648))) (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse1 2147483648))) (<= .cse0 .cse1)))))))) (forall ((v_ArrVal_398 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_398))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse3 2147483647)) (<= .cse3 .cse4)))) (not (<= .cse4 2147483647)) (not (<= 0 (+ .cse4 2147483648))))))) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_398))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse6 2147483647)) (not (<= 0 (+ .cse6 2147483648))) (<= (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse6))))) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_398))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse8 2147483647)) (not (<= 0 (+ .cse8 2147483648))) (<= .cse8 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) is different from false [2022-12-12 15:36:26,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:36:26,486 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 99 treesize of output 63 [2022-12-12 15:36:26,489 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 238 treesize of output 214 [2022-12-12 15:36:26,494 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 205 treesize of output 189 [2022-12-12 15:36:26,497 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 189 treesize of output 177 [2022-12-12 15:36:26,602 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:36:26,603 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2022-12-12 15:36:26,607 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:36:26,608 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 15:36:26,614 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:36:26,614 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2022-12-12 15:36:26,635 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 15:36:26,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674172294] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:26,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:26,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-12 15:36:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568983229] [2022-12-12 15:36:26,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:26,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-12 15:36:26,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:26,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-12 15:36:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=433, Unknown=13, NotChecked=90, Total=650 [2022-12-12 15:36:26,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:26,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 269 transitions, 3975 flow. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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 15:36:26,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:26,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:26,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:26,762 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~sum1~0 0) (or (not (< 0 c_~N~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= 0 (+ c_~bag1~0 2147483648)) (<= c_~bag2~0 2147483647) (= c_~bag2~0 c_~sum1~0) (or (not (< c_~i~0 c_~N~0)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (let ((.cse3 (+ c_~bag1~0 c_~sum1~0 .cse1)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) c_~A~0.base) .cse4))) (or (<= (+ .cse2 c_~bag2~0 c_~sum2~0) .cse3) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647))))) (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_399) c_~A~0.base) .cse4))) (or (<= .cse3 (+ .cse5 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (not (<= (+ .cse5 c_~bag2~0) 2147483647))))))))) (and (or .cse0 (not (<= (+ c_~bag1~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse1 2147483648)))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) (not (< c_~j~0 c_~N~0))) (<= 0 (+ c_~bag2~0 2147483648)) (<= c_~bag1~0 2147483647) (= c_~bag2~0 c_~bag1~0) (= c_~sum2~0 0)) is different from false [2022-12-12 15:36:36,542 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 100 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:36:45,835 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 101 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:36:46,838 INFO L130 PetriNetUnfolder]: 746/1340 cut-off events. [2022-12-12 15:36:46,838 INFO L131 PetriNetUnfolder]: For 8586/8586 co-relation queries the response was YES. [2022-12-12 15:36:46,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10229 conditions, 1340 events. 746/1340 cut-off events. For 8586/8586 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7287 event pairs, 50 based on Foata normal form. 3/1343 useless extension candidates. Maximal degree in co-relation 10028. Up to 326 conditions per place. [2022-12-12 15:36:46,851 INFO L137 encePairwiseOnDemand]: 3/16 looper letters, 182 selfloop transitions, 287 changer transitions 10/479 dead transitions. [2022-12-12 15:36:46,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 479 transitions, 7396 flow [2022-12-12 15:36:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-12 15:36:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-12 15:36:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 200 transitions. [2022-12-12 15:36:46,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2022-12-12 15:36:46,855 INFO L175 Difference]: Start difference. First operand has 199 places, 269 transitions, 3975 flow. Second operand 36 states and 200 transitions. [2022-12-12 15:36:46,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 479 transitions, 7396 flow [2022-12-12 15:36:46,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 479 transitions, 7050 flow, removed 16 selfloop flow, removed 17 redundant places. [2022-12-12 15:36:46,910 INFO L231 Difference]: Finished difference. Result has 235 places, 394 transitions, 6560 flow [2022-12-12 15:36:46,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=3752, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=6560, PETRI_PLACES=235, PETRI_TRANSITIONS=394} [2022-12-12 15:36:46,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 215 predicate places. [2022-12-12 15:36:46,911 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 394 transitions, 6560 flow [2022-12-12 15:36:46,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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 15:36:46,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:46,911 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:46,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:47,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 15:36:47,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -4147713, now seen corresponding path program 10 times [2022-12-12 15:36:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:47,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554941399] [2022-12-12 15:36:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:47,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:47,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554941399] [2022-12-12 15:36:47,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554941399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:47,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246068249] [2022-12-12 15:36:47,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 15:36:47,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:47,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-12 15:36:47,304 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 15:36:47,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:47,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 15:36:47,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:47,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:47,506 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 239 treesize of output 223 [2022-12-12 15:36:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:47,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246068249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:47,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:47,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-12 15:36:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500088872] [2022-12-12 15:36:47,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:47,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 15:36:47,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:47,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 15:36:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-12 15:36:47,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:47,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 394 transitions, 6560 flow. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 15:36:47,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:47,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:47,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:48,185 INFO L130 PetriNetUnfolder]: 661/1201 cut-off events. [2022-12-12 15:36:48,186 INFO L131 PetriNetUnfolder]: For 12286/12286 co-relation queries the response was YES. [2022-12-12 15:36:48,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10663 conditions, 1201 events. 661/1201 cut-off events. For 12286/12286 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6343 event pairs, 71 based on Foata normal form. 96/1297 useless extension candidates. Maximal degree in co-relation 10574. Up to 439 conditions per place. [2022-12-12 15:36:48,204 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 214 selfloop transitions, 187 changer transitions 0/401 dead transitions. [2022-12-12 15:36:48,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 401 transitions, 7098 flow [2022-12-12 15:36:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 15:36:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 15:36:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2022-12-12 15:36:48,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35661764705882354 [2022-12-12 15:36:48,205 INFO L175 Difference]: Start difference. First operand has 235 places, 394 transitions, 6560 flow. Second operand 17 states and 97 transitions. [2022-12-12 15:36:48,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 401 transitions, 7098 flow [2022-12-12 15:36:48,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 401 transitions, 6521 flow, removed 155 selfloop flow, removed 21 redundant places. [2022-12-12 15:36:48,271 INFO L231 Difference]: Finished difference. Result has 218 places, 356 transitions, 5723 flow [2022-12-12 15:36:48,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=4879, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5723, PETRI_PLACES=218, PETRI_TRANSITIONS=356} [2022-12-12 15:36:48,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 198 predicate places. [2022-12-12 15:36:48,273 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 356 transitions, 5723 flow [2022-12-12 15:36:48,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 15:36:48,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:48,273 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:48,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:48,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-12 15:36:48,478 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1397939031, now seen corresponding path program 11 times [2022-12-12 15:36:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:48,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611814480] [2022-12-12 15:36:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:48,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:48,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611814480] [2022-12-12 15:36:48,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611814480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:48,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376305301] [2022-12-12 15:36:48,610 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 15:36:48,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:48,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:48,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:48,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-12 15:36:48,696 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:36:48,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:48,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-12 15:36:48,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:48,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:49,499 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-12 15:36:49,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 497 treesize of output 353 [2022-12-12 15:36:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:36:49,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376305301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:49,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:49,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-12-12 15:36:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626888708] [2022-12-12 15:36:49,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:49,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 15:36:49,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:49,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 15:36:49,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-12 15:36:49,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:49,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 356 transitions, 5723 flow. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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 15:36:49,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:49,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:49,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:50,860 INFO L130 PetriNetUnfolder]: 471/907 cut-off events. [2022-12-12 15:36:50,861 INFO L131 PetriNetUnfolder]: For 10040/10040 co-relation queries the response was YES. [2022-12-12 15:36:50,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8128 conditions, 907 events. 471/907 cut-off events. For 10040/10040 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4676 event pairs, 19 based on Foata normal form. 65/972 useless extension candidates. Maximal degree in co-relation 8072. Up to 225 conditions per place. [2022-12-12 15:36:50,871 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 138 selfloop transitions, 172 changer transitions 15/325 dead transitions. [2022-12-12 15:36:50,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 325 transitions, 5828 flow [2022-12-12 15:36:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 15:36:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 15:36:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 108 transitions. [2022-12-12 15:36:50,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-12 15:36:50,886 INFO L175 Difference]: Start difference. First operand has 218 places, 356 transitions, 5723 flow. Second operand 19 states and 108 transitions. [2022-12-12 15:36:50,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 325 transitions, 5828 flow [2022-12-12 15:36:50,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 325 transitions, 5256 flow, removed 93 selfloop flow, removed 19 redundant places. [2022-12-12 15:36:50,939 INFO L231 Difference]: Finished difference. Result has 208 places, 264 transitions, 4595 flow [2022-12-12 15:36:50,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=3802, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4595, PETRI_PLACES=208, PETRI_TRANSITIONS=264} [2022-12-12 15:36:50,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 188 predicate places. [2022-12-12 15:36:50,939 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 264 transitions, 4595 flow [2022-12-12 15:36:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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 15:36:50,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:50,939 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:50,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-12 15:36:51,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 15:36:51,140 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash -218638174, now seen corresponding path program 12 times [2022-12-12 15:36:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:51,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050804045] [2022-12-12 15:36:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:36:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:51,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050804045] [2022-12-12 15:36:51,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050804045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:51,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454640031] [2022-12-12 15:36:51,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 15:36:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:51,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:51,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:51,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-12 15:36:51,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-12 15:36:51,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:36:51,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 15:36:51,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:36:51,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:51,637 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 239 treesize of output 223 [2022-12-12 15:36:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:36:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454640031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:36:51,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:36:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-12 15:36:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461293419] [2022-12-12 15:36:51,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:36:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 15:36:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:36:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 15:36:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-12 15:36:51,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:36:51,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 264 transitions, 4595 flow. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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 15:36:51,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:36:51,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:36:51,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:36:51,939 INFO L130 PetriNetUnfolder]: 370/693 cut-off events. [2022-12-12 15:36:51,939 INFO L131 PetriNetUnfolder]: For 8377/8377 co-relation queries the response was YES. [2022-12-12 15:36:51,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6183 conditions, 693 events. 370/693 cut-off events. For 8377/8377 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3069 event pairs, 101 based on Foata normal form. 22/715 useless extension candidates. Maximal degree in co-relation 6129. Up to 492 conditions per place. [2022-12-12 15:36:51,945 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 177 selfloop transitions, 7 changer transitions 36/220 dead transitions. [2022-12-12 15:36:51,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 220 transitions, 4098 flow [2022-12-12 15:36:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 15:36:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 15:36:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-12-12 15:36:51,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-12 15:36:51,946 INFO L175 Difference]: Start difference. First operand has 208 places, 264 transitions, 4595 flow. Second operand 7 states and 38 transitions. [2022-12-12 15:36:51,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 220 transitions, 4098 flow [2022-12-12 15:36:51,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 220 transitions, 3845 flow, removed 33 selfloop flow, removed 25 redundant places. [2022-12-12 15:36:51,983 INFO L231 Difference]: Finished difference. Result has 168 places, 179 transitions, 2982 flow [2022-12-12 15:36:51,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2982, PETRI_PLACES=168, PETRI_TRANSITIONS=179} [2022-12-12 15:36:51,983 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 148 predicate places. [2022-12-12 15:36:51,983 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 179 transitions, 2982 flow [2022-12-12 15:36:51,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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 15:36:51,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:36:51,984 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:36:51,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-12 15:36:52,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:52,184 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:36:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:36:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2050264676, now seen corresponding path program 13 times [2022-12-12 15:36:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:36:52,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923828897] [2022-12-12 15:36:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:36:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:36:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:36:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:36:54,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923828897] [2022-12-12 15:36:54,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923828897] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:36:54,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608276658] [2022-12-12 15:36:54,584 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 15:36:54,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:36:54,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:36:54,585 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:36:54,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-12 15:36:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:36:54,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-12 15:36:54,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:36:55,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:36:55,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 205 [2022-12-12 15:36:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:36:55,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:36:58,610 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 15:36:58,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1231 treesize of output 485 [2022-12-12 15:37:02,833 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 15:37:02,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 615 treesize of output 257 [2022-12-12 15:37:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 15:37:06,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608276658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:37:06,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:37:06,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 33 [2022-12-12 15:37:06,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403888101] [2022-12-12 15:37:06,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:37:06,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 15:37:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:37:06,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 15:37:06,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2022-12-12 15:37:06,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:37:06,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 179 transitions, 2982 flow. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 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 15:37:06,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:37:06,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:37:06,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:37:34,672 INFO L130 PetriNetUnfolder]: 1455/2398 cut-off events. [2022-12-12 15:37:34,673 INFO L131 PetriNetUnfolder]: For 29521/29521 co-relation queries the response was YES. [2022-12-12 15:37:34,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21222 conditions, 2398 events. 1455/2398 cut-off events. For 29521/29521 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12632 event pairs, 14 based on Foata normal form. 9/2407 useless extension candidates. Maximal degree in co-relation 21173. Up to 709 conditions per place. [2022-12-12 15:37:34,690 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 282 selfloop transitions, 590 changer transitions 14/886 dead transitions. [2022-12-12 15:37:34,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 886 transitions, 14696 flow [2022-12-12 15:37:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-12-12 15:37:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2022-12-12 15:37:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 538 transitions. [2022-12-12 15:37:34,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3113425925925926 [2022-12-12 15:37:34,693 INFO L175 Difference]: Start difference. First operand has 168 places, 179 transitions, 2982 flow. Second operand 108 states and 538 transitions. [2022-12-12 15:37:34,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 886 transitions, 14696 flow [2022-12-12 15:37:34,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 886 transitions, 14176 flow, removed 230 selfloop flow, removed 8 redundant places. [2022-12-12 15:37:34,816 INFO L231 Difference]: Finished difference. Result has 242 places, 654 transitions, 12850 flow [2022-12-12 15:37:34,816 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=12850, PETRI_PLACES=242, PETRI_TRANSITIONS=654} [2022-12-12 15:37:34,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 222 predicate places. [2022-12-12 15:37:34,817 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 654 transitions, 12850 flow [2022-12-12 15:37:34,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 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 15:37:34,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:37:34,817 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:37:34,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-12 15:37:35,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:37:35,018 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:37:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:37:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1076597590, now seen corresponding path program 14 times [2022-12-12 15:37:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:37:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074842934] [2022-12-12 15:37:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:37:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:37:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:37:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:37:38,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:37:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074842934] [2022-12-12 15:37:38,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074842934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:37:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275934980] [2022-12-12 15:37:38,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 15:37:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:37:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:37:38,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:37:38,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-12 15:37:38,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:37:38,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:37:38,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-12 15:37:38,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:37:39,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:37:39,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-12 15:37:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:37:39,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:37:42,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:37:42,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1251 treesize of output 520 [2022-12-12 15:37:58,028 INFO L321 Elim1Store]: treesize reduction 32, result has 39.6 percent of original size [2022-12-12 15:37:58,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1226 treesize of output 479 [2022-12-12 15:38:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 15:38:00,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275934980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:38:00,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:38:00,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 34 [2022-12-12 15:38:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125243725] [2022-12-12 15:38:00,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:38:00,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-12 15:38:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:38:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-12 15:38:00,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2022-12-12 15:38:00,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:38:00,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 654 transitions, 12850 flow. Second operand has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 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 15:38:00,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:38:00,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:38:00,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:38:14,927 INFO L130 PetriNetUnfolder]: 1795/2983 cut-off events. [2022-12-12 15:38:14,928 INFO L131 PetriNetUnfolder]: For 37221/37221 co-relation queries the response was YES. [2022-12-12 15:38:14,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28031 conditions, 2983 events. 1795/2983 cut-off events. For 37221/37221 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16578 event pairs, 81 based on Foata normal form. 6/2989 useless extension candidates. Maximal degree in co-relation 27978. Up to 908 conditions per place. [2022-12-12 15:38:14,952 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 544 selfloop transitions, 382 changer transitions 22/948 dead transitions. [2022-12-12 15:38:14,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 948 transitions, 18972 flow [2022-12-12 15:38:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-12 15:38:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-12 15:38:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 239 transitions. [2022-12-12 15:38:14,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3734375 [2022-12-12 15:38:14,953 INFO L175 Difference]: Start difference. First operand has 242 places, 654 transitions, 12850 flow. Second operand 40 states and 239 transitions. [2022-12-12 15:38:14,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 948 transitions, 18972 flow [2022-12-12 15:38:15,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 948 transitions, 16085 flow, removed 1290 selfloop flow, removed 11 redundant places. [2022-12-12 15:38:15,304 INFO L231 Difference]: Finished difference. Result has 285 places, 792 transitions, 14303 flow [2022-12-12 15:38:15,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=10780, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=14303, PETRI_PLACES=285, PETRI_TRANSITIONS=792} [2022-12-12 15:38:15,305 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 265 predicate places. [2022-12-12 15:38:15,305 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 792 transitions, 14303 flow [2022-12-12 15:38:15,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 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 15:38:15,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:38:15,305 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:38:15,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-12 15:38:15,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:38:15,506 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:38:15,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:38:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash -492101646, now seen corresponding path program 15 times [2022-12-12 15:38:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:38:15,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901033834] [2022-12-12 15:38:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:38:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:38:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:38:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 15:38:20,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:38:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901033834] [2022-12-12 15:38:20,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901033834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:38:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899681965] [2022-12-12 15:38:20,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 15:38:20,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:38:20,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:38:20,444 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:38:20,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-12 15:38:20,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 15:38:20,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:38:20,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-12 15:38:20,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:38:20,621 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 13 treesize of output 9 [2022-12-12 15:38:20,660 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 15:38:20,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 15:38:20,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-12 15:38:21,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:38:21,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-12 15:38:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:38:21,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:38:23,486 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse52 (* c_~j~0 4)) (.cse27 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1|))) (let ((.cse0 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1| 2147483648)))) (.cse1 (not (<= .cse27 2147483647))) (.cse12 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse13 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse11 (not (< (+ c_~j~0 1) c_~N~0))) (.cse6 (+ c_~A~0.offset .cse52 4)) (.cse7 (+ c_~A~0.offset .cse52)) (.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse26 (< (+ c_~i~0 1) c_~N~0))) (and (or .cse0 .cse1 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (and (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse2 (select .cse4 .cse7)) (.cse3 (select .cse4 .cse6))) (or (not (<= (+ .cse2 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse2 c_~bag2~0 .cse3 2147483648))) (<= (+ .cse2 c_~bag2~0 c_~sum2~0 .cse3) (+ c_~bag1~0 (select .cse4 .cse5) c_~sum1~0)) (not (<= (+ .cse2 c_~bag2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse7)) (.cse9 (select .cse10 .cse6))) (or (not (<= (+ .cse8 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse8 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse8 c_~bag2~0 .cse9 2147483648))) (not (<= (+ .cse8 c_~bag2~0 .cse9) 2147483647)) (<= (+ c_~bag1~0 (select .cse10 .cse5) c_~sum1~0) (+ .cse8 c_~bag2~0 c_~sum2~0 .cse9))))))) .cse11) (or .cse12 .cse13 (and (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse7)) (.cse15 (select .cse16 .cse6))) (or (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse15 1)) (<= (+ .cse14 c_~bag2~0 c_~sum2~0 .cse15) (+ c_~bag1~0 (select .cse16 .cse5) c_~sum1~0)) (not (<= 0 (+ .cse14 .cse15 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse7)) (.cse18 (select .cse19 .cse6))) (or (not (<= (+ .cse17 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse18 1)) (<= (+ c_~bag1~0 (select .cse19 .cse5) c_~sum1~0) (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18)) (not (<= 0 (+ .cse17 .cse18 2147483648)))))))) .cse11) (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse7)) (.cse21 (select .cse22 .cse6))) (or (not (<= (+ .cse20 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse20 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse20 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse20 c_~bag2~0 2147483648))) (not (<= (+ .cse20 .cse21) 2147483647)) (<= (+ .cse20 c_~bag2~0 c_~sum2~0 .cse21) (+ c_~bag1~0 (select .cse22 .cse5) c_~sum1~0)) (not (<= 0 (+ .cse20 .cse21 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse7)) (.cse24 (select .cse25 .cse6))) (or (not (<= (+ .cse23 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse23 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse23 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse23 c_~bag2~0 2147483648))) (not (<= (+ .cse23 .cse24) 2147483647)) (<= (+ c_~bag1~0 (select .cse25 .cse5) c_~sum1~0) (+ .cse23 c_~bag2~0 c_~sum2~0 .cse24)) (not (<= 0 (+ .cse23 .cse24 2147483648)))))))) .cse11)))) .cse26 (not (<= c_~cap1~0 .cse27)) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse0 .cse1 (and (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse29 (select .cse31 .cse5)) (.cse28 (select .cse31 .cse7)) (.cse30 (select .cse31 .cse6))) (or (not (<= (+ .cse28 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse28 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse29 2147483648))) (not (<= (+ c_~bag1~0 .cse29) 2147483647)) (not (<= 0 (+ .cse28 c_~bag2~0 .cse30 2147483648))) (<= (+ .cse28 c_~bag2~0 c_~sum2~0 .cse30) (+ c_~bag1~0 .cse29 c_~sum1~0)) (not (<= (+ .cse28 c_~bag2~0 .cse30) 2147483647)))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse33 (select .cse35 .cse5)) (.cse32 (select .cse35 .cse7)) (.cse34 (select .cse35 .cse6))) (or (not (<= (+ .cse32 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse32 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse33 2147483648))) (not (<= (+ c_~bag1~0 .cse33) 2147483647)) (not (<= 0 (+ .cse32 c_~bag2~0 .cse34 2147483648))) (not (<= (+ .cse32 c_~bag2~0 .cse34) 2147483647)) (<= (+ c_~bag1~0 .cse33 c_~sum1~0) (+ .cse32 c_~bag2~0 c_~sum2~0 .cse34))))))) .cse11) (or .cse12 .cse13 (and (or .cse11 (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse38 (select .cse39 .cse5)) (.cse36 (select .cse39 .cse7)) (.cse37 (select .cse39 .cse6))) (or (not (<= (+ .cse36 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse37 1)) (not (<= 0 (+ c_~bag1~0 .cse38 2147483648))) (not (<= (+ c_~bag1~0 .cse38) 2147483647)) (<= (+ c_~bag1~0 .cse38 c_~sum1~0) (+ .cse36 c_~bag2~0 c_~sum2~0 .cse37)) (not (<= 0 (+ .cse36 .cse37 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse5)) (.cse40 (select .cse43 .cse7)) (.cse41 (select .cse43 .cse6))) (or (not (<= (+ .cse40 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse41 1)) (not (<= 0 (+ c_~bag1~0 .cse42 2147483648))) (not (<= (+ c_~bag1~0 .cse42) 2147483647)) (<= (+ .cse40 c_~bag2~0 c_~sum2~0 .cse41) (+ c_~bag1~0 .cse42 c_~sum1~0)) (not (<= 0 (+ .cse40 .cse41 2147483648))))))))) (or .cse11 (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse5)) (.cse44 (select .cse47 .cse7)) (.cse46 (select .cse47 .cse6))) (or (not (<= (+ .cse44 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse44 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse44 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse44 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse45 2147483648))) (not (<= (+ c_~bag1~0 .cse45) 2147483647)) (not (<= (+ .cse44 .cse46) 2147483647)) (<= (+ .cse44 c_~bag2~0 c_~sum2~0 .cse46) (+ c_~bag1~0 .cse45 c_~sum1~0)) (not (<= 0 (+ .cse44 .cse46 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse5)) (.cse48 (select .cse51 .cse7)) (.cse50 (select .cse51 .cse6))) (or (not (<= (+ .cse48 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse48 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse48 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse48 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse49 2147483648))) (not (<= (+ c_~bag1~0 .cse49) 2147483647)) (not (<= (+ .cse48 .cse50) 2147483647)) (<= (+ c_~bag1~0 .cse49 c_~sum1~0) (+ .cse48 c_~bag2~0 c_~sum2~0 .cse50)) (not (<= 0 (+ .cse48 .cse50 2147483648)))))))))))) .cse26 (not (< .cse27 c_~cap1~0)))))) is different from false [2022-12-12 15:38:23,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset (* c_~i~0 4)))) (let ((.cse52 (select (select |c_#memory_int| c_~A~0.base) .cse6))) (let ((.cse53 (* c_~j~0 4)) (.cse32 (+ c_~bag1~0 .cse52))) (let ((.cse30 (not (<= .cse32 2147483647))) (.cse12 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse13 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse4 (+ c_~A~0.offset .cse53 4)) (.cse5 (+ c_~A~0.offset .cse53)) (.cse11 (not (< (+ c_~j~0 1) c_~N~0))) (.cse31 (not (<= 0 (+ c_~bag1~0 .cse52 2147483648)))) (.cse33 (< (+ c_~i~0 1) c_~N~0))) (and (or (and (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse1 2147483648))) (not (<= (+ c_~bag1~0 .cse1) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 .cse2 2147483648))) (<= (+ .cse0 c_~bag2~0 c_~sum2~0 .cse2) (+ c_~bag1~0 .cse1 c_~sum1~0)) (not (<= (+ .cse0 c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse6)) (.cse7 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (not (<= (+ .cse7 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse8 2147483648))) (not (<= (+ c_~bag1~0 .cse8) 2147483647)) (not (<= 0 (+ .cse7 c_~bag2~0 .cse9 2147483648))) (not (<= (+ .cse7 c_~bag2~0 .cse9) 2147483647)) (<= (+ c_~bag1~0 .cse8 c_~sum1~0) (+ .cse7 c_~bag2~0 c_~sum2~0 .cse9))))))) .cse11) (or .cse12 .cse13 (and (or .cse11 (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse6)) (.cse14 (select .cse17 .cse5)) (.cse15 (select .cse17 .cse4))) (or (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse15 1)) (not (<= 0 (+ c_~bag1~0 .cse16 2147483648))) (not (<= (+ c_~bag1~0 .cse16) 2147483647)) (<= (+ c_~bag1~0 .cse16 c_~sum1~0) (+ .cse14 c_~bag2~0 c_~sum2~0 .cse15)) (not (<= 0 (+ .cse14 .cse15 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse6)) (.cse18 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse4))) (or (not (<= (+ .cse18 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse19 1)) (not (<= 0 (+ c_~bag1~0 .cse20 2147483648))) (not (<= (+ c_~bag1~0 .cse20) 2147483647)) (<= (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19) (+ c_~bag1~0 .cse20 c_~sum1~0)) (not (<= 0 (+ .cse18 .cse19 2147483648))))))))) (or .cse11 (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse22 (select .cse25 .cse5)) (.cse24 (select .cse25 .cse4))) (or (not (<= (+ .cse22 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse22 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse22 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse22 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse23 2147483648))) (not (<= (+ c_~bag1~0 .cse23) 2147483647)) (not (<= (+ .cse22 .cse24) 2147483647)) (<= (+ .cse22 c_~bag2~0 c_~sum2~0 .cse24) (+ c_~bag1~0 .cse23 c_~sum1~0)) (not (<= 0 (+ .cse22 .cse24 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse27 (select .cse29 .cse6)) (.cse26 (select .cse29 .cse5)) (.cse28 (select .cse29 .cse4))) (or (not (<= (+ .cse26 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse26 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse26 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse26 c_~bag2~0 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse27 2147483648))) (not (<= (+ c_~bag1~0 .cse27) 2147483647)) (not (<= (+ .cse26 .cse28) 2147483647)) (<= (+ c_~bag1~0 .cse27 c_~sum1~0) (+ .cse26 c_~bag2~0 c_~sum2~0 .cse28)) (not (<= 0 (+ .cse26 .cse28 2147483648)))))))))))) .cse30 .cse31 (not (< .cse32 c_~cap1~0)) .cse33) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (not (<= c_~cap1~0 .cse32)) .cse30 (and (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse34 (select .cse36 .cse5)) (.cse35 (select .cse36 .cse4))) (or (not (<= (+ .cse34 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse34 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse34 c_~bag2~0 .cse35 2147483648))) (<= (+ .cse34 c_~bag2~0 c_~sum2~0 .cse35) (+ c_~bag1~0 (select .cse36 .cse6) c_~sum1~0)) (not (<= (+ .cse34 c_~bag2~0 .cse35) 2147483647)))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse37 (select .cse39 .cse5)) (.cse38 (select .cse39 .cse4))) (or (not (<= (+ .cse37 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse37 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse37 c_~bag2~0 .cse38 2147483648))) (not (<= (+ .cse37 c_~bag2~0 .cse38) 2147483647)) (<= (+ c_~bag1~0 (select .cse39 .cse6) c_~sum1~0) (+ .cse37 c_~bag2~0 c_~sum2~0 .cse38))))))) .cse11) (or .cse12 .cse13 (and (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse40 (select .cse42 .cse5)) (.cse41 (select .cse42 .cse4))) (or (not (<= (+ .cse40 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse41 1)) (<= (+ .cse40 c_~bag2~0 c_~sum2~0 .cse41) (+ c_~bag1~0 (select .cse42 .cse6) c_~sum1~0)) (not (<= 0 (+ .cse40 .cse41 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse43 (select .cse45 .cse5)) (.cse44 (select .cse45 .cse4))) (or (not (<= (+ .cse43 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse44 1)) (<= (+ c_~bag1~0 (select .cse45 .cse6) c_~sum1~0) (+ .cse43 c_~bag2~0 c_~sum2~0 .cse44)) (not (<= 0 (+ .cse43 .cse44 2147483648)))))))) .cse11) (or (and (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse46 (select .cse48 .cse5)) (.cse47 (select .cse48 .cse4))) (or (not (<= (+ .cse46 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse46 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse46 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse46 c_~bag2~0 2147483648))) (not (<= (+ .cse46 .cse47) 2147483647)) (<= (+ .cse46 c_~bag2~0 c_~sum2~0 .cse47) (+ c_~bag1~0 (select .cse48 .cse6) c_~sum1~0)) (not (<= 0 (+ .cse46 .cse47 2147483648))))))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse5)) (.cse50 (select .cse51 .cse4))) (or (not (<= (+ .cse49 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse49 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse49 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse49 c_~bag2~0 2147483648))) (not (<= (+ .cse49 .cse50) 2147483647)) (<= (+ c_~bag1~0 (select .cse51 .cse6) c_~sum1~0) (+ .cse49 c_~bag2~0 c_~sum2~0 .cse50)) (not (<= 0 (+ .cse49 .cse50 2147483648)))))))) .cse11)))) .cse31 .cse33 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))))) is different from false [2022-12-12 15:38:31,034 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (not (< 1 c_~N~0))) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (< 2 c_~N~0))) (and (or .cse0 (and (or (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse8 .cse6))) (or (not (<= 0 (+ .cse1 .cse2 2147483648))) (not (<= .cse2 2147483647)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 .cse6)) (.cse4 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648 .cse3))) (not (<= (+ .cse4 .cse3) 2147483647)) (<= .cse4 .cse2) (not (<= .cse4 2147483647)))))) (< 0 (+ .cse1 1))))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (select .cse15 .cse6))) (or (not (<= 0 (+ .cse9 .cse10 2147483648))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse13 .cse6)) (.cse11 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse11 2147483648))) (not (<= 0 (+ .cse11 2147483648 .cse12))) (not (<= (+ .cse10 .cse12) 2147483647)) (<= .cse10 .cse11))))) (not (<= .cse10 2147483647)) (< 0 (+ .cse9 1)))))))) .cse16) (or (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse23 .cse6)) (.cse18 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (not (<= .cse18 2147483647)) (< 0 (+ .cse17 1)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse21 .cse6)) (.cse20 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse19 1)) (not (<= 0 (+ .cse20 2147483648 .cse19))) (<= .cse18 .cse20)))))))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse24 (select .cse30 .cse6))) (or (not (<= 0 (+ .cse24 .cse25 2147483648))) (not (<= .cse25 2147483647)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse28 (select (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse26 (select .cse28 .cse6)) (.cse27 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse25 2147483648 .cse26))) (<= .cse27 .cse25) (< 0 (+ .cse26 1)) (not (<= .cse27 2147483647)))))) (< 0 (+ .cse24 1)))))))) .cse16))) (or .cse0 (and (or .cse16 (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse32 (select .cse37 .cse6))) (or (not (<= 0 (+ .cse31 2147483648))) (< 2147483647 (+ .cse32 .cse31)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse33 (select .cse35 .cse6)) (.cse34 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse33 1)) (not (<= 0 (+ .cse34 2147483648 .cse33))) (<= .cse31 .cse34))))) (< .cse32 1)))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse39 (select .cse44 .cse6))) (or (not (<= 0 (+ .cse38 2147483648))) (< 2147483647 (+ .cse39 .cse38)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse42 (select (store .cse43 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse42 .cse6)) (.cse40 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse40 .cse38) (< 0 (+ .cse41 1)) (not (<= 0 (+ .cse40 2147483648 .cse41))) (not (<= .cse40 2147483647)))))) (< .cse39 1)))))))) (or (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse51 (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse45 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse50 (select .cse51 .cse6))) (or (not (<= 0 (+ .cse45 2147483648))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse48 (select (store .cse49 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse47 (select .cse48 .cse6)) (.cse46 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse46 .cse47) 2147483647)) (not (<= 0 (+ .cse46 2147483648))) (not (<= 0 (+ .cse46 2147483648 .cse47))) (<= .cse45 .cse46))))) (< 2147483647 (+ .cse50 .cse45)) (< .cse50 1)))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse52 (select .cse58 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse53 (select .cse58 .cse6))) (or (not (<= 0 (+ .cse52 2147483648))) (< 2147483647 (+ .cse53 .cse52)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse56 (select (store .cse57 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse55 (select .cse56 .cse6)) (.cse54 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse54 .cse55) 2147483647)) (<= .cse54 .cse52) (not (<= 0 (+ .cse54 2147483648 .cse55))) (not (<= .cse54 2147483647)))))) (< .cse53 1))))))) .cse16))) (or (and (or (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse60 (select .cse65 .cse6)) (.cse59 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse59 2147483648))) (not (<= .cse59 2147483647)) (< (+ .cse60 .cse59 2147483648) 0) (< 2147483647 (+ .cse60 .cse59)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse63 (select (store .cse64 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse62 (select .cse63 .cse6)) (.cse61 (select .cse63 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse61 .cse59) (< 0 (+ .cse62 1)) (not (<= 0 (+ .cse61 2147483648 .cse62))) (not (<= .cse61 2147483647))))))))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse67 (select .cse72 .cse6)) (.cse66 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse66 2147483648))) (not (<= .cse66 2147483647)) (< (+ .cse67 .cse66 2147483648) 0) (< 2147483647 (+ .cse67 .cse66)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse70 (select (store .cse71 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse68 (select .cse70 .cse6)) (.cse69 (select .cse70 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse68 1)) (not (<= 0 (+ .cse69 2147483648 .cse68))) (<= .cse66 .cse69))))))))))) .cse16) (or (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse74 (select .cse79 .cse6)) (.cse73 (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse73 2147483648))) (not (<= .cse73 2147483647)) (< (+ .cse74 .cse73 2147483648) 0) (< 2147483647 (+ .cse74 .cse73)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse77 (select (store .cse78 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse76 (select .cse77 .cse6)) (.cse75 (select .cse77 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse75 .cse76) 2147483647)) (<= .cse75 .cse73) (not (<= 0 (+ .cse75 2147483648 .cse76))) (not (<= .cse75 2147483647))))))))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse86 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse85 (select .cse86 .cse6)) (.cse80 (select .cse86 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse80 2147483648))) (not (<= .cse80 2147483647)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse83 (select (store .cse84 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse82 (select .cse83 .cse6)) (.cse81 (select .cse83 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse81 .cse82) 2147483647)) (not (<= 0 (+ .cse81 2147483648))) (not (<= 0 (+ .cse81 2147483648 .cse82))) (<= .cse80 .cse81))))) (< (+ .cse85 .cse80 2147483648) 0) (< 2147483647 (+ .cse85 .cse80)))))))) .cse16)) .cse0) (or (and (or (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse87 (select .cse93 .cse6)) (.cse88 (select .cse93 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse87 .cse88 2147483648))) (not (<= 0 (+ .cse88 2147483648))) (not (<= .cse88 2147483647)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse91 (select (store .cse92 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse89 (select .cse91 .cse6)) (.cse90 (select .cse91 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse88 2147483648 .cse89))) (not (<= (+ .cse90 .cse89) 2147483647)) (<= .cse90 .cse88) (not (<= .cse90 2147483647)))))) (not (<= (+ .cse87 .cse88) 2147483647))))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse100 (select .cse99 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse94 (select .cse100 .cse6)) (.cse95 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse94 .cse95 2147483648))) (not (<= 0 (+ .cse95 2147483648))) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse98 (select (store .cse99 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse97 (select .cse98 .cse6)) (.cse96 (select .cse98 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse96 2147483648))) (not (<= 0 (+ .cse96 2147483648 .cse97))) (not (<= (+ .cse95 .cse97) 2147483647)) (<= .cse95 .cse96))))) (not (<= .cse95 2147483647)) (not (<= (+ .cse94 .cse95) 2147483647)))))))) .cse16) (or .cse16 (and (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse106 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse107 (select .cse106 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse101 (select .cse107 .cse6)) (.cse102 (select .cse107 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse101 .cse102 2147483648))) (not (<= 0 (+ .cse102 2147483648))) (not (<= .cse102 2147483647)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse105 (select (store .cse106 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse103 (select .cse105 .cse6)) (.cse104 (select .cse105 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse102 2147483648 .cse103))) (<= .cse104 .cse102) (< 0 (+ .cse103 1)) (not (<= .cse104 2147483647)))))) (not (<= (+ .cse101 .cse102) 2147483647))))))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598))) (let ((.cse114 (select .cse113 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse108 (select .cse114 .cse6)) (.cse109 (select .cse114 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse108 .cse109 2147483648))) (not (<= 0 (+ .cse109 2147483648))) (not (<= .cse109 2147483647)) (forall ((v_ArrVal_599 (Array Int Int))) (let ((.cse112 (select (store .cse113 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse110 (select .cse112 .cse6)) (.cse111 (select .cse112 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse110 1)) (not (<= 0 (+ .cse111 2147483648 .cse110))) (<= .cse109 .cse111))))) (not (<= (+ .cse108 .cse109) 2147483647)))))))))) .cse0))) is different from false [2022-12-12 15:38:31,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:38:31,284 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 315 treesize of output 171 [2022-12-12 15:38:31,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:38:31,294 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 848 treesize of output 740 [2022-12-12 15:38:31,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:38:31,312 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 701 treesize of output 641 [2022-12-12 15:38:31,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:38:31,325 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 582 treesize of output 510 [2022-12-12 15:38:31,633 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,634 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 317 treesize of output 1 [2022-12-12 15:38:31,640 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,641 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 266 treesize of output 1 [2022-12-12 15:38:31,647 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,647 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 292 treesize of output 1 [2022-12-12 15:38:31,658 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,658 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 223 treesize of output 1 [2022-12-12 15:38:31,665 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,665 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 246 treesize of output 1 [2022-12-12 15:38:31,673 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,673 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 269 treesize of output 1 [2022-12-12 15:38:31,680 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,680 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 271 treesize of output 1 [2022-12-12 15:38:31,693 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,693 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 291 treesize of output 1 [2022-12-12 15:38:31,699 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,700 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 268 treesize of output 1 [2022-12-12 15:38:31,709 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,709 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 314 treesize of output 1 [2022-12-12 15:38:31,716 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,716 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 316 treesize of output 1 [2022-12-12 15:38:31,724 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,724 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 272 treesize of output 1 [2022-12-12 15:38:31,731 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,731 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 270 treesize of output 1 [2022-12-12 15:38:31,738 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,739 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 247 treesize of output 1 [2022-12-12 15:38:31,744 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 15:38:31,745 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 221 treesize of output 1 [2022-12-12 15:38:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-12 15:38:31,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899681965] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:38:31,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:38:31,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2022-12-12 15:38:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570381106] [2022-12-12 15:38:31,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:38:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-12 15:38:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:38:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-12 15:38:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=952, Unknown=6, NotChecked=198, Total=1332 [2022-12-12 15:38:31,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:38:31,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 792 transitions, 14303 flow. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 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 15:38:31,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:38:31,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:38:31,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:39:04,565 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 299 DAG size of output: 274 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:39:11,462 INFO L130 PetriNetUnfolder]: 2048/3442 cut-off events. [2022-12-12 15:39:11,462 INFO L131 PetriNetUnfolder]: For 33809/33809 co-relation queries the response was YES. [2022-12-12 15:39:11,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28537 conditions, 3442 events. 2048/3442 cut-off events. For 33809/33809 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20199 event pairs, 35 based on Foata normal form. 2/3444 useless extension candidates. Maximal degree in co-relation 28473. Up to 1437 conditions per place. [2022-12-12 15:39:11,488 INFO L137 encePairwiseOnDemand]: 5/16 looper letters, 303 selfloop transitions, 730 changer transitions 15/1048 dead transitions. [2022-12-12 15:39:11,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1048 transitions, 20140 flow [2022-12-12 15:39:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-12 15:39:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-12 15:39:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2022-12-12 15:39:11,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-12 15:39:11,490 INFO L175 Difference]: Start difference. First operand has 285 places, 792 transitions, 14303 flow. Second operand 35 states and 160 transitions. [2022-12-12 15:39:11,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1048 transitions, 20140 flow [2022-12-12 15:39:11,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 1048 transitions, 19861 flow, removed 108 selfloop flow, removed 9 redundant places. [2022-12-12 15:39:11,867 INFO L231 Difference]: Finished difference. Result has 320 places, 966 transitions, 19280 flow [2022-12-12 15:39:11,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=14068, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=576, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=19280, PETRI_PLACES=320, PETRI_TRANSITIONS=966} [2022-12-12 15:39:11,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 300 predicate places. [2022-12-12 15:39:11,867 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 966 transitions, 19280 flow [2022-12-12 15:39:11,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 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 15:39:11,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:39:11,868 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:39:11,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-12 15:39:12,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:39:12,068 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:39:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:39:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1268118482, now seen corresponding path program 16 times [2022-12-12 15:39:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:39:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19987296] [2022-12-12 15:39:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:39:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:39:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:39:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:39:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:39:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19987296] [2022-12-12 15:39:15,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19987296] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:39:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554001098] [2022-12-12 15:39:15,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 15:39:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:39:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:39:15,438 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:39:15,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-12 15:39:15,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 15:39:15,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:39:15,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-12 15:39:15,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:39:15,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 15:39:15,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 15:39:16,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:39:16,149 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 313 treesize of output 205 [2022-12-12 15:39:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 15:39:16,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:39:23,650 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:23,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4377 treesize of output 3127 [2022-12-12 15:39:23,726 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:23,727 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 3057 treesize of output 2990 [2022-12-12 15:39:23,799 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:23,800 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 2977 treesize of output 2910 [2022-12-12 15:39:23,871 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:23,872 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 2897 treesize of output 2842 [2022-12-12 15:39:23,942 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:23,943 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 2829 treesize of output 2774 [2022-12-12 15:39:23,971 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 15:39:24,005 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,006 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 2761 treesize of output 2668 [2022-12-12 15:39:24,077 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,078 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 2655 treesize of output 2562 [2022-12-12 15:39:24,138 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,139 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 2549 treesize of output 2482 [2022-12-12 15:39:24,217 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,218 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 2469 treesize of output 2402 [2022-12-12 15:39:24,286 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,287 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 2389 treesize of output 2333 [2022-12-12 15:39:24,313 INFO L208 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2022-12-12 15:39:24,343 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,344 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 2320 treesize of output 2264 [2022-12-12 15:39:24,400 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,400 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 2251 treesize of output 2170 [2022-12-12 15:39:24,456 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:24,457 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 2157 treesize of output 2076 [2022-12-12 15:39:26,256 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2881 treesize of output 2069 [2022-12-12 15:39:26,317 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,318 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 2023 treesize of output 1918 [2022-12-12 15:39:26,381 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,382 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 1905 treesize of output 1800 [2022-12-12 15:39:26,440 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,441 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 1787 treesize of output 1706 [2022-12-12 15:39:26,508 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,509 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 1693 treesize of output 1612 [2022-12-12 15:39:26,528 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 15:39:26,561 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,562 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 1599 treesize of output 1506 [2022-12-12 15:39:26,626 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 15:39:26,626 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 1493 treesize of output 1400 [2022-12-12 15:39:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 15:39:27,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554001098] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:39:27,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:39:27,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 35 [2022-12-12 15:39:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564909505] [2022-12-12 15:39:27,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:39:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 15:39:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:39:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 15:39:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1055, Unknown=5, NotChecked=0, Total=1260 [2022-12-12 15:39:27,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:39:27,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 966 transitions, 19280 flow. Second operand has 36 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 36 states have internal predecessors, (55), 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 15:39:27,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:39:27,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:39:27,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:40:14,844 INFO L130 PetriNetUnfolder]: 2616/4320 cut-off events. [2022-12-12 15:40:14,844 INFO L131 PetriNetUnfolder]: For 71681/71681 co-relation queries the response was YES. [2022-12-12 15:40:14,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42993 conditions, 4320 events. 2616/4320 cut-off events. For 71681/71681 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 25705 event pairs, 4 based on Foata normal form. 15/4335 useless extension candidates. Maximal degree in co-relation 42917. Up to 994 conditions per place. [2022-12-12 15:40:14,885 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 254 selfloop transitions, 1180 changer transitions 10/1444 dead transitions. [2022-12-12 15:40:14,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1444 transitions, 30459 flow [2022-12-12 15:40:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-12 15:40:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-12-12 15:40:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 345 transitions. [2022-12-12 15:40:14,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2953767123287671 [2022-12-12 15:40:14,887 INFO L175 Difference]: Start difference. First operand has 320 places, 966 transitions, 19280 flow. Second operand 73 states and 345 transitions. [2022-12-12 15:40:14,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1444 transitions, 30459 flow [2022-12-12 15:40:15,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1444 transitions, 28897 flow, removed 242 selfloop flow, removed 23 redundant places. [2022-12-12 15:40:15,609 INFO L231 Difference]: Finished difference. Result has 371 places, 1290 transitions, 27908 flow [2022-12-12 15:40:15,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=16488, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=799, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=27908, PETRI_PLACES=371, PETRI_TRANSITIONS=1290} [2022-12-12 15:40:15,610 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 351 predicate places. [2022-12-12 15:40:15,610 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 1290 transitions, 27908 flow [2022-12-12 15:40:15,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 36 states have internal predecessors, (55), 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 15:40:15,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:40:15,610 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:40:15,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-12 15:40:15,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:40:15,815 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 15:40:15,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:40:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1673637740, now seen corresponding path program 17 times [2022-12-12 15:40:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:40:15,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72501307] [2022-12-12 15:40:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:40:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:40:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:40:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:40:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:40:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72501307] [2022-12-12 15:40:19,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72501307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:40:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443350270] [2022-12-12 15:40:19,660 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 15:40:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:40:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:40:19,661 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 15:40:19,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-12 15:40:19,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 15:40:19,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:40:19,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-12 15:40:19,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:40:19,840 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 13 treesize of output 9 [2022-12-12 15:40:19,881 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 15:40:19,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 15:40:19,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 15:40:20,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 15:40:20,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-12 15:40:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:40:20,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:40:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 15:40:32,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443350270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:40:32,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:40:32,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2022-12-12 15:40:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80003163] [2022-12-12 15:40:32,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:40:32,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-12 15:40:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:40:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-12 15:40:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1112, Unknown=13, NotChecked=0, Total=1332 [2022-12-12 15:40:32,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 15:40:32,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1290 transitions, 27908 flow. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 37 states have internal predecessors, (57), 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 15:40:32,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:40:32,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 15:40:32,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:40:48,536 WARN L233 SmtUtils]: Spent 14.73s on a formula simplification. DAG size of input: 327 DAG size of output: 274 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:40:57,105 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 349 DAG size of output: 347 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:41:10,819 WARN L233 SmtUtils]: Spent 13.15s on a formula simplification. DAG size of input: 321 DAG size of output: 270 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:41:20,354 WARN L233 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 341 DAG size of output: 270 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:41:32,429 WARN L233 SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 313 DAG size of output: 311 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:41:59,572 WARN L233 SmtUtils]: Spent 22.31s on a formula simplification. DAG size of input: 339 DAG size of output: 273 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:42:07,635 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 339 DAG size of output: 337 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:42:09,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 15:42:23,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 15:42:28,258 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-12 15:42:28,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-12 15:42:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-12 15:42:28,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-12 15:42:28,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:42:28,463 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 62 more [2022-12-12 15:42:28,466 INFO L158 Benchmark]: Toolchain (without parser) took 413327.56ms. Allocated memory was 198.2MB in the beginning and 879.8MB in the end (delta: 681.6MB). Free memory was 173.6MB in the beginning and 616.6MB in the end (delta: -443.0MB). Peak memory consumption was 639.8MB. Max. memory is 8.0GB. [2022-12-12 15:42:28,466 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 15:42:28,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.00ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 161.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 15:42:28,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.63ms. Allocated memory is still 198.2MB. Free memory was 161.4MB in the beginning and 158.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 15:42:28,467 INFO L158 Benchmark]: Boogie Preprocessor took 45.06ms. Allocated memory is still 198.2MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 15:42:28,467 INFO L158 Benchmark]: RCFGBuilder took 531.10ms. Allocated memory is still 198.2MB. Free memory was 156.8MB in the beginning and 132.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-12 15:42:28,467 INFO L158 Benchmark]: TraceAbstraction took 412523.52ms. Allocated memory was 198.2MB in the beginning and 879.8MB in the end (delta: 681.6MB). Free memory was 131.4MB in the beginning and 616.6MB in the end (delta: -485.2MB). Peak memory consumption was 597.9MB. Max. memory is 8.0GB. [2022-12-12 15:42:28,468 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.00ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 161.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.63ms. Allocated memory is still 198.2MB. Free memory was 161.4MB in the beginning and 158.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.06ms. Allocated memory is still 198.2MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 531.10ms. Allocated memory is still 198.2MB. Free memory was 156.8MB in the beginning and 132.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 412523.52ms. Allocated memory was 198.2MB in the beginning and 879.8MB in the end (delta: 681.6MB). Free memory was 131.4MB in the beginning and 616.6MB in the end (delta: -485.2MB). Peak memory consumption was 597.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 305 PlacesBefore, 20 PlacesAfterwards, 326 TransitionsBefore, 16 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 91 TrivialYvCompositions, 194 ConcurrentYvCompositions, 25 ChoiceCompositions, 310 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 17021, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17040, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 15363, unknown conditional: 0, unknown unconditional: 15363] , Statistics on independence cache: Total cache size (in pairs): 34757, Positive cache size: 34742, Positive conditional cache size: 0, Positive unconditional cache size: 34742, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...