/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 20:54:00,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 20:54:00,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 20:54:00,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 20:54:00,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 20:54:00,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 20:54:00,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 20:54:00,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 20:54:00,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 20:54:00,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 20:54:00,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 20:54:00,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 20:54:00,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 20:54:00,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 20:54:00,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 20:54:00,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 20:54:00,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 20:54:00,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 20:54:00,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 20:54:00,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 20:54:00,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 20:54:00,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 20:54:00,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 20:54:00,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 20:54:00,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 20:54:00,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 20:54:00,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 20:54:00,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 20:54:00,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 20:54:00,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 20:54:00,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 20:54:00,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 20:54:00,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 20:54:00,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 20:54:00,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 20:54:00,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 20:54:00,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 20:54:00,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 20:54:00,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 20:54:00,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 20:54:00,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 20:54:00,082 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-VariableLbe.epf [2023-01-27 20:54:00,105 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 20:54:00,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 20:54:00,106 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 20:54:00,106 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 20:54:00,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 20:54:00,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 20:54:00,107 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 20:54:00,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 20:54:00,107 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 20:54:00,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 20:54:00,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 20:54:00,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 20:54:00,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 20:54:00,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 20:54:00,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 20:54:00,108 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 20:54:00,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 20:54:00,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 20:54:00,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 20:54:00,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 20:54:00,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 20:54:00,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 20:54:00,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 20:54:00,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 20:54:00,110 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 20:54:00,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 20:54:00,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 20:54:00,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 20:54:00,268 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 20:54:00,268 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 20:54:00,269 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 [2023-01-27 20:54:01,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 20:54:01,395 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 20:54:01,395 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-01-27 20:54:01,399 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17764c65/f239ce6ac0734418a8b13dc703baa2cb/FLAG0a4e49472 [2023-01-27 20:54:01,409 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17764c65/f239ce6ac0734418a8b13dc703baa2cb [2023-01-27 20:54:01,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 20:54:01,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 20:54:01,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 20:54:01,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 20:54:01,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 20:54:01,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1288de20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01, skipping insertion in model container [2023-01-27 20:54:01,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 20:54:01,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 20:54:01,530 WARN L247 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] [2023-01-27 20:54:01,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 20:54:01,543 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 20:54:01,562 WARN L247 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] [2023-01-27 20:54:01,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 20:54:01,573 INFO L208 MainTranslator]: Completed translation [2023-01-27 20:54:01,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01 WrapperNode [2023-01-27 20:54:01,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 20:54:01,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 20:54:01,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 20:54:01,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 20:54:01,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,604 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 287 [2023-01-27 20:54:01,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 20:54:01,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 20:54:01,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 20:54:01,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 20:54:01,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 20:54:01,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 20:54:01,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 20:54:01,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 20:54:01,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (1/1) ... [2023-01-27 20:54:01,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 20:54:01,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:01,656 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) [2023-01-27 20:54:01,658 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 [2023-01-27 20:54:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 20:54:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 20:54:01,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 20:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 20:54:01,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 20:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 20:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 20:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 20:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 20:54:01,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 20:54:01,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 20:54:01,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 20:54:01,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 20:54:01,692 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 20:54:01,764 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 20:54:01,765 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 20:54:02,077 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 20:54:02,084 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 20:54:02,085 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-27 20:54:02,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 08:54:02 BoogieIcfgContainer [2023-01-27 20:54:02,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 20:54:02,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 20:54:02,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 20:54:02,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 20:54:02,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 08:54:01" (1/3) ... [2023-01-27 20:54:02,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2af7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 08:54:02, skipping insertion in model container [2023-01-27 20:54:02,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:54:01" (2/3) ... [2023-01-27 20:54:02,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2af7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 08:54:02, skipping insertion in model container [2023-01-27 20:54:02,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 08:54:02" (3/3) ... [2023-01-27 20:54:02,091 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-01-27 20:54:02,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 20:54:02,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 20:54:02,101 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 20:54:02,222 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 20:54:02,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 346 transitions, 708 flow [2023-01-27 20:54:02,357 INFO L130 PetriNetUnfolder]: 28/344 cut-off events. [2023-01-27 20:54:02,357 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 20:54:02,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 344 events. 28/344 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 768 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2023-01-27 20:54:02,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 346 transitions, 708 flow [2023-01-27 20:54:02,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 336 transitions, 684 flow [2023-01-27 20:54:02,371 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 20:54:02,376 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 336 transitions, 684 flow [2023-01-27 20:54:02,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 336 transitions, 684 flow [2023-01-27 20:54:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 684 flow [2023-01-27 20:54:02,423 INFO L130 PetriNetUnfolder]: 28/336 cut-off events. [2023-01-27 20:54:02,423 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 20:54:02,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 336 events. 28/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 761 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2023-01-27 20:54:02,434 INFO L119 LiptonReduction]: Number of co-enabled transitions 25652 [2023-01-27 20:54:10,515 INFO L134 LiptonReduction]: Checked pairs total: 22140 [2023-01-27 20:54:10,516 INFO L136 LiptonReduction]: Total number of compositions: 413 [2023-01-27 20:54:10,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 20:54:10,539 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;@4400a1e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 20:54:10,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-27 20:54:10,545 INFO L130 PetriNetUnfolder]: 4/16 cut-off events. [2023-01-27 20:54:10,546 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 20:54:10,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:10,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:10,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:10,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 200185486, now seen corresponding path program 1 times [2023-01-27 20:54:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570314145] [2023-01-27 20:54:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:11,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570314145] [2023-01-27 20:54:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570314145] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:54:11,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:54:11,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 20:54:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236780873] [2023-01-27 20:54:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:54:11,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 20:54:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 20:54:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 20:54:11,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-27 20:54:11,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 294.4) internal successors, (1472), 5 states have internal predecessors, (1472), 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) [2023-01-27 20:54:11,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:11,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-27 20:54:11,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:11,370 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2023-01-27 20:54:11,370 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-27 20:54:11,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 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. [2023-01-27 20:54:11,373 INFO L137 encePairwiseOnDemand]: 752/759 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2023-01-27 20:54:11,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2023-01-27 20:54:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:54:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:54:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1508 transitions. [2023-01-27 20:54:11,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397364953886693 [2023-01-27 20:54:11,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1508 transitions. [2023-01-27 20:54:11,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1508 transitions. [2023-01-27 20:54:11,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:11,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1508 transitions. [2023-01-27 20:54:11,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 301.6) internal successors, (1508), 5 states have internal predecessors, (1508), 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) [2023-01-27 20:54:11,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:11,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:11,416 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 46 flow. Second operand 5 states and 1508 transitions. [2023-01-27 20:54:11,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 43 transitions, 199 flow [2023-01-27 20:54:11,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 20:54:11,420 INFO L231 Difference]: Finished difference. Result has 23 places, 25 transitions, 99 flow [2023-01-27 20:54:11,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, 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} [2023-01-27 20:54:11,423 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-01-27 20:54:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 25 transitions, 99 flow [2023-01-27 20:54:11,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 294.4) internal successors, (1472), 5 states have internal predecessors, (1472), 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) [2023-01-27 20:54:11,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:11,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:11,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 20:54:11,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:11,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -419197718, now seen corresponding path program 1 times [2023-01-27 20:54:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281526852] [2023-01-27 20:54:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281526852] [2023-01-27 20:54:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281526852] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:54:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:54:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 20:54:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025556779] [2023-01-27 20:54:11,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:54:11,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 20:54:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 20:54:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 20:54:11,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 759 [2023-01-27 20:54:11,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 299.25) internal successors, (1197), 4 states have internal predecessors, (1197), 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) [2023-01-27 20:54:11,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:11,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 759 [2023-01-27 20:54:11,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:11,613 INFO L130 PetriNetUnfolder]: 109/196 cut-off events. [2023-01-27 20:54:11,613 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-01-27 20:54:11,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 196 events. 109/196 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 634 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. [2023-01-27 20:54:11,617 INFO L137 encePairwiseOnDemand]: 753/759 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2023-01-27 20:54:11,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 54 transitions, 307 flow [2023-01-27 20:54:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:54:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:54:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1522 transitions. [2023-01-27 20:54:11,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010540184453228 [2023-01-27 20:54:11,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1522 transitions. [2023-01-27 20:54:11,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1522 transitions. [2023-01-27 20:54:11,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:11,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1522 transitions. [2023-01-27 20:54:11,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.4) internal successors, (1522), 5 states have internal predecessors, (1522), 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) [2023-01-27 20:54:11,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:11,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:11,629 INFO L175 Difference]: Start difference. First operand has 23 places, 25 transitions, 99 flow. Second operand 5 states and 1522 transitions. [2023-01-27 20:54:11,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 54 transitions, 307 flow [2023-01-27 20:54:11,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 54 transitions, 305 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-27 20:54:11,633 INFO L231 Difference]: Finished difference. Result has 30 places, 34 transitions, 205 flow [2023-01-27 20:54:11,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, 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} [2023-01-27 20:54:11,633 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2023-01-27 20:54:11,634 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 34 transitions, 205 flow [2023-01-27 20:54:11,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.25) internal successors, (1197), 4 states have internal predecessors, (1197), 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) [2023-01-27 20:54:11,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:11,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 20:54:11,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:11,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1716415558, now seen corresponding path program 2 times [2023-01-27 20:54:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608663519] [2023-01-27 20:54:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608663519] [2023-01-27 20:54:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608663519] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:54:11,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:54:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 20:54:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439154545] [2023-01-27 20:54:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:54:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 20:54:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 20:54:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 20:54:11,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-27 20:54:11,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 295.25) internal successors, (1181), 4 states have internal predecessors, (1181), 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) [2023-01-27 20:54:11,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:11,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-27 20:54:11,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:11,856 INFO L130 PetriNetUnfolder]: 169/319 cut-off events. [2023-01-27 20:54:11,856 INFO L131 PetriNetUnfolder]: For 569/569 co-relation queries the response was YES. [2023-01-27 20:54:11,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 319 events. 169/319 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1234 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. [2023-01-27 20:54:11,858 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 55 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2023-01-27 20:54:11,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 66 transitions, 514 flow [2023-01-27 20:54:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:54:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:54:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1497 transitions. [2023-01-27 20:54:11,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39446640316205533 [2023-01-27 20:54:11,862 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1497 transitions. [2023-01-27 20:54:11,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1497 transitions. [2023-01-27 20:54:11,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:11,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1497 transitions. [2023-01-27 20:54:11,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 299.4) internal successors, (1497), 5 states have internal predecessors, (1497), 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) [2023-01-27 20:54:11,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:11,870 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:11,870 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 205 flow. Second operand 5 states and 1497 transitions. [2023-01-27 20:54:11,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 66 transitions, 514 flow [2023-01-27 20:54:11,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 502 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-01-27 20:54:11,873 INFO L231 Difference]: Finished difference. Result has 37 places, 39 transitions, 278 flow [2023-01-27 20:54:11,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, 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} [2023-01-27 20:54:11,874 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2023-01-27 20:54:11,874 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 278 flow [2023-01-27 20:54:11,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 295.25) internal successors, (1181), 4 states have internal predecessors, (1181), 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) [2023-01-27 20:54:11,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:11,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:11,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 20:54:11,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:11,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1708128844, now seen corresponding path program 1 times [2023-01-27 20:54:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834892505] [2023-01-27 20:54:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834892505] [2023-01-27 20:54:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834892505] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:54:11,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:54:11,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 20:54:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252034473] [2023-01-27 20:54:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:54:11,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 20:54:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 20:54:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 20:54:11,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 759 [2023-01-27 20:54:11,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 299.5) internal successors, (1198), 4 states have internal predecessors, (1198), 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) [2023-01-27 20:54:11,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:11,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 759 [2023-01-27 20:54:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:12,016 INFO L130 PetriNetUnfolder]: 155/293 cut-off events. [2023-01-27 20:54:12,016 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2023-01-27 20:54:12,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 293 events. 155/293 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1124 event pairs, 16 based on Foata normal form. 6/299 useless extension candidates. Maximal degree in co-relation 758. Up to 134 conditions per place. [2023-01-27 20:54:12,017 INFO L137 encePairwiseOnDemand]: 753/759 looper letters, 39 selfloop transitions, 20 changer transitions 6/65 dead transitions. [2023-01-27 20:54:12,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 551 flow [2023-01-27 20:54:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:54:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:54:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1519 transitions. [2023-01-27 20:54:12,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4002635046113307 [2023-01-27 20:54:12,021 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1519 transitions. [2023-01-27 20:54:12,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1519 transitions. [2023-01-27 20:54:12,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:12,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1519 transitions. [2023-01-27 20:54:12,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.8) internal successors, (1519), 5 states have internal predecessors, (1519), 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) [2023-01-27 20:54:12,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:12,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:12,029 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 278 flow. Second operand 5 states and 1519 transitions. [2023-01-27 20:54:12,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 551 flow [2023-01-27 20:54:12,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 541 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-01-27 20:54:12,032 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 399 flow [2023-01-27 20:54:12,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-01-27 20:54:12,033 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2023-01-27 20:54:12,033 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 399 flow [2023-01-27 20:54:12,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.5) internal successors, (1198), 4 states have internal predecessors, (1198), 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) [2023-01-27 20:54:12,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:12,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:12,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 20:54:12,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:12,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1411080757, now seen corresponding path program 1 times [2023-01-27 20:54:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:12,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269156459] [2023-01-27 20:54:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269156459] [2023-01-27 20:54:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269156459] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:54:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:54:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 20:54:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106311091] [2023-01-27 20:54:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:54:12,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 20:54:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 20:54:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 20:54:12,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-27 20:54:12,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 295.5) internal successors, (1182), 4 states have internal predecessors, (1182), 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) [2023-01-27 20:54:12,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:12,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-27 20:54:12,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:12,163 INFO L130 PetriNetUnfolder]: 94/176 cut-off events. [2023-01-27 20:54:12,163 INFO L131 PetriNetUnfolder]: For 590/590 co-relation queries the response was YES. [2023-01-27 20:54:12,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 176 events. 94/176 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 536 event pairs, 34 based on Foata normal form. 6/182 useless extension candidates. Maximal degree in co-relation 765. Up to 126 conditions per place. [2023-01-27 20:54:12,164 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 40 selfloop transitions, 4 changer transitions 10/54 dead transitions. [2023-01-27 20:54:12,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 510 flow [2023-01-27 20:54:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:54:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:54:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1493 transitions. [2023-01-27 20:54:12,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39341238471673257 [2023-01-27 20:54:12,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1493 transitions. [2023-01-27 20:54:12,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1493 transitions. [2023-01-27 20:54:12,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:12,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1493 transitions. [2023-01-27 20:54:12,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 298.6) internal successors, (1493), 5 states have internal predecessors, (1493), 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) [2023-01-27 20:54:12,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:12,174 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:12,174 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 399 flow. Second operand 5 states and 1493 transitions. [2023-01-27 20:54:12,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 510 flow [2023-01-27 20:54:12,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 500 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-01-27 20:54:12,177 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 328 flow [2023-01-27 20:54:12,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-01-27 20:54:12,177 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2023-01-27 20:54:12,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 328 flow [2023-01-27 20:54:12,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 295.5) internal successors, (1182), 4 states have internal predecessors, (1182), 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) [2023-01-27 20:54:12,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:12,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:12,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 20:54:12,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:12,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1125366281, now seen corresponding path program 1 times [2023-01-27 20:54:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965933557] [2023-01-27 20:54:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:12,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965933557] [2023-01-27 20:54:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965933557] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448063594] [2023-01-27 20:54:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:12,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:12,287 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) [2023-01-27 20:54:12,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 20:54:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:12,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 20:54:12,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:12,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448063594] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:54:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-01-27 20:54:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751714378] [2023-01-27 20:54:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:54:12,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 20:54:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:12,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 20:54:12,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-27 20:54:12,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-27 20:54:12,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 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) [2023-01-27 20:54:12,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:12,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-27 20:54:12,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:12,545 INFO L130 PetriNetUnfolder]: 100/169 cut-off events. [2023-01-27 20:54:12,545 INFO L131 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2023-01-27 20:54:12,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 169 events. 100/169 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 440 event pairs, 18 based on Foata normal form. 16/185 useless extension candidates. Maximal degree in co-relation 767. Up to 111 conditions per place. [2023-01-27 20:54:12,546 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-01-27 20:54:12,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 458 flow [2023-01-27 20:54:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:54:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:54:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1485 transitions. [2023-01-27 20:54:12,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2023-01-27 20:54:12,549 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1485 transitions. [2023-01-27 20:54:12,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1485 transitions. [2023-01-27 20:54:12,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:12,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1485 transitions. [2023-01-27 20:54:12,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 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) [2023-01-27 20:54:12,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:12,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 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) [2023-01-27 20:54:12,556 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 328 flow. Second operand 5 states and 1485 transitions. [2023-01-27 20:54:12,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 458 flow [2023-01-27 20:54:12,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 410 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-01-27 20:54:12,558 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 303 flow [2023-01-27 20:54:12,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-01-27 20:54:12,559 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2023-01-27 20:54:12,559 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 303 flow [2023-01-27 20:54:12,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 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) [2023-01-27 20:54:12,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:12,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:12,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 20:54:12,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 20:54:12,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:12,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -4780107, now seen corresponding path program 1 times [2023-01-27 20:54:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688065188] [2023-01-27 20:54:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:12,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688065188] [2023-01-27 20:54:14,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688065188] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:14,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848027699] [2023-01-27 20:54:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:14,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:14,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:14,521 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) [2023-01-27 20:54:14,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 20:54:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:14,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-27 20:54:14,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:14,964 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 143 treesize of output 107 [2023-01-27 20:54:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:15,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:15,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:15,781 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 253 treesize of output 221 [2023-01-27 20:54:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848027699] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:16,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2023-01-27 20:54:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375813816] [2023-01-27 20:54:16,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 20:54:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 20:54:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-01-27 20:54:16,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-27 20:54:16,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 303 flow. Second operand has 20 states, 20 states have (on average 245.25) internal successors, (4905), 20 states have internal predecessors, (4905), 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) [2023-01-27 20:54:16,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:16,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-27 20:54:16,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:16,925 INFO L130 PetriNetUnfolder]: 272/472 cut-off events. [2023-01-27 20:54:16,925 INFO L131 PetriNetUnfolder]: For 1192/1192 co-relation queries the response was YES. [2023-01-27 20:54:16,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 472 events. 272/472 cut-off events. For 1192/1192 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1811 event pairs, 6 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 1728. Up to 181 conditions per place. [2023-01-27 20:54:16,936 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 104 selfloop transitions, 55 changer transitions 7/166 dead transitions. [2023-01-27 20:54:16,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 166 transitions, 1411 flow [2023-01-27 20:54:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-27 20:54:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-27 20:54:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4743 transitions. [2023-01-27 20:54:16,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3288953609319742 [2023-01-27 20:54:16,945 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4743 transitions. [2023-01-27 20:54:16,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4743 transitions. [2023-01-27 20:54:16,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:16,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4743 transitions. [2023-01-27 20:54:16,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 249.6315789473684) internal successors, (4743), 19 states have internal predecessors, (4743), 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) [2023-01-27 20:54:16,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 759.0) internal successors, (15180), 20 states have internal predecessors, (15180), 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) [2023-01-27 20:54:16,978 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 759.0) internal successors, (15180), 20 states have internal predecessors, (15180), 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) [2023-01-27 20:54:16,978 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 303 flow. Second operand 19 states and 4743 transitions. [2023-01-27 20:54:16,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 166 transitions, 1411 flow [2023-01-27 20:54:16,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 166 transitions, 1408 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 20:54:16,984 INFO L231 Difference]: Finished difference. Result has 71 places, 87 transitions, 943 flow [2023-01-27 20:54:16,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=943, PETRI_PLACES=71, PETRI_TRANSITIONS=87} [2023-01-27 20:54:16,985 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 51 predicate places. [2023-01-27 20:54:16,985 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 943 flow [2023-01-27 20:54:16,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 245.25) internal successors, (4905), 20 states have internal predecessors, (4905), 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) [2023-01-27 20:54:16,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:16,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:17,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-27 20:54:17,211 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,SelfDestructingSolverStorable6 [2023-01-27 20:54:17,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:17,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1877271009, now seen corresponding path program 2 times [2023-01-27 20:54:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126080898] [2023-01-27 20:54:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:18,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:18,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126080898] [2023-01-27 20:54:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126080898] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:18,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800759513] [2023-01-27 20:54:18,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:54:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:18,432 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) [2023-01-27 20:54:18,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 20:54:18,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:54:18,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:18,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-27 20:54:18,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:18,851 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 137 treesize of output 101 [2023-01-27 20:54:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:18,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:19,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:19,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 221 [2023-01-27 20:54:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800759513] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:19,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-01-27 20:54:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241005766] [2023-01-27 20:54:19,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-27 20:54:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-27 20:54:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-01-27 20:54:19,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 759 [2023-01-27 20:54:19,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 943 flow. Second operand has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 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) [2023-01-27 20:54:19,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:19,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 759 [2023-01-27 20:54:19,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:21,956 INFO L130 PetriNetUnfolder]: 647/1126 cut-off events. [2023-01-27 20:54:21,956 INFO L131 PetriNetUnfolder]: For 7759/7759 co-relation queries the response was YES. [2023-01-27 20:54:21,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1126 events. 647/1126 cut-off events. For 7759/7759 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5655 event pairs, 14 based on Foata normal form. 24/1150 useless extension candidates. Maximal degree in co-relation 5613. Up to 387 conditions per place. [2023-01-27 20:54:21,963 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 172 selfloop transitions, 212 changer transitions 17/401 dead transitions. [2023-01-27 20:54:21,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 401 transitions, 4549 flow [2023-01-27 20:54:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-27 20:54:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-27 20:54:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 11788 transitions. [2023-01-27 20:54:21,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3376296041702469 [2023-01-27 20:54:21,983 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 11788 transitions. [2023-01-27 20:54:21,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 11788 transitions. [2023-01-27 20:54:21,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:21,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 11788 transitions. [2023-01-27 20:54:22,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 256.2608695652174) internal successors, (11788), 46 states have internal predecessors, (11788), 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) [2023-01-27 20:54:22,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 759.0) internal successors, (35673), 47 states have internal predecessors, (35673), 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) [2023-01-27 20:54:22,028 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 759.0) internal successors, (35673), 47 states have internal predecessors, (35673), 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) [2023-01-27 20:54:22,028 INFO L175 Difference]: Start difference. First operand has 71 places, 87 transitions, 943 flow. Second operand 46 states and 11788 transitions. [2023-01-27 20:54:22,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 401 transitions, 4549 flow [2023-01-27 20:54:22,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 401 transitions, 4260 flow, removed 139 selfloop flow, removed 3 redundant places. [2023-01-27 20:54:22,053 INFO L231 Difference]: Finished difference. Result has 125 places, 253 transitions, 3493 flow [2023-01-27 20:54:22,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3493, PETRI_PLACES=125, PETRI_TRANSITIONS=253} [2023-01-27 20:54:22,056 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2023-01-27 20:54:22,056 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 253 transitions, 3493 flow [2023-01-27 20:54:22,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 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) [2023-01-27 20:54:22,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:22,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:22,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 20:54:22,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:22,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:22,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1904976639, now seen corresponding path program 3 times [2023-01-27 20:54:22,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134049865] [2023-01-27 20:54:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:22,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134049865] [2023-01-27 20:54:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134049865] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404033772] [2023-01-27 20:54:23,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 20:54:23,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:23,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:23,392 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) [2023-01-27 20:54:23,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 20:54:23,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 20:54:23,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:23,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-27 20:54:23,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:23,548 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 [2023-01-27 20:54:23,604 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 [2023-01-27 20:54:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 20:54:23,882 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 143 treesize of output 107 [2023-01-27 20:54:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:23,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404033772] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:24,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:24,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2023-01-27 20:54:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648164173] [2023-01-27 20:54:24,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:24,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-27 20:54:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:24,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-27 20:54:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=328, Unknown=2, NotChecked=0, Total=420 [2023-01-27 20:54:24,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-27 20:54:24,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 253 transitions, 3493 flow. Second operand has 21 states, 21 states have (on average 245.0) internal successors, (5145), 21 states have internal predecessors, (5145), 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) [2023-01-27 20:54:24,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:24,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-27 20:54:24,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:29,373 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base)) (.cse15 (+ c_~A~0.offset (* c_~j~0 4)))) (let ((.cse24 (select .cse8 .cse15)) (.cse23 (+ c_~bag1~0 c_~sum1~0))) (let ((.cse2 (< 2147483647 .cse23)) (.cse3 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse9 (+ c_~A~0.offset (* c_~i~0 4))) (.cse0 (< (+ c_~bag2~0 .cse24 2147483648) 0)) (.cse1 (< 2147483647 (+ c_~bag2~0 .cse24))) (.cse10 (<= c_~N~0 c_~j~0)) (.cse6 (+ c_~bag2~0 .cse24 c_~sum2~0)) (.cse11 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse0 .cse1 (let ((.cse5 (select .cse8 .cse9))) (let ((.cse4 (let ((.cse7 (+ c_~bag1~0 c_~sum1~0 .cse5))) (and (<= .cse6 .cse7) (<= .cse7 .cse6))))) (and (or .cse2 .cse3 .cse4) (or (< 2147483647 (+ c_~bag1~0 .cse5)) .cse4 (< (+ c_~bag1~0 .cse5 2147483648) 0))))) .cse10) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~sum1~0 2147483647) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum1~0 2147483648)) (or (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse15)) (.cse12 (select .cse14 .cse9))) (or (< (+ c_~bag1~0 .cse12 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13)) (<= (+ c_~bag1~0 c_~sum1~0 .cse12) (+ c_~bag2~0 c_~sum2~0 .cse13)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse12)))))) (or (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse15))) (or (< 2147483647 (+ c_~bag2~0 .cse16)) (<= (+ c_~bag2~0 c_~sum2~0 .cse16) (+ c_~bag1~0 c_~sum1~0 (select .cse17 .cse9))) (< (+ c_~bag2~0 .cse16 2147483648) 0))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse15))) (or (< 2147483647 (+ c_~bag2~0 .cse18)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse9)) (+ c_~bag2~0 c_~sum2~0 .cse18)) (< (+ c_~bag2~0 .cse18 2147483648) 0)))))) .cse2 .cse3) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse15)) (.cse20 (select .cse22 .cse9))) (or (< (+ c_~bag1~0 .cse20 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse21)) (<= (+ c_~bag2~0 c_~sum2~0 .cse21) (+ c_~bag1~0 c_~sum1~0 .cse20)) (< (+ c_~bag2~0 .cse21 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse20))))))) .cse10) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or .cse0 .cse1 .cse10 (and (<= .cse6 .cse23) (<= .cse23 .cse6))) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|))))) is different from false [2023-01-27 20:54:32,879 INFO L130 PetriNetUnfolder]: 824/1490 cut-off events. [2023-01-27 20:54:32,879 INFO L131 PetriNetUnfolder]: For 14285/14285 co-relation queries the response was YES. [2023-01-27 20:54:32,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 1490 events. 824/1490 cut-off events. For 14285/14285 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8246 event pairs, 33 based on Foata normal form. 4/1494 useless extension candidates. Maximal degree in co-relation 9552. Up to 506 conditions per place. [2023-01-27 20:54:32,890 INFO L137 encePairwiseOnDemand]: 745/759 looper letters, 223 selfloop transitions, 186 changer transitions 11/420 dead transitions. [2023-01-27 20:54:32,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 420 transitions, 6158 flow [2023-01-27 20:54:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-01-27 20:54:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-01-27 20:54:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6984 transitions. [2023-01-27 20:54:32,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3286278938452851 [2023-01-27 20:54:32,897 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6984 transitions. [2023-01-27 20:54:32,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6984 transitions. [2023-01-27 20:54:32,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:32,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6984 transitions. [2023-01-27 20:54:32,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 249.42857142857142) internal successors, (6984), 28 states have internal predecessors, (6984), 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) [2023-01-27 20:54:32,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 759.0) internal successors, (22011), 29 states have internal predecessors, (22011), 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) [2023-01-27 20:54:32,917 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 759.0) internal successors, (22011), 29 states have internal predecessors, (22011), 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) [2023-01-27 20:54:32,917 INFO L175 Difference]: Start difference. First operand has 125 places, 253 transitions, 3493 flow. Second operand 28 states and 6984 transitions. [2023-01-27 20:54:32,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 420 transitions, 6158 flow [2023-01-27 20:54:32,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 420 transitions, 4895 flow, removed 595 selfloop flow, removed 9 redundant places. [2023-01-27 20:54:32,985 INFO L231 Difference]: Finished difference. Result has 158 places, 321 transitions, 4060 flow [2023-01-27 20:54:32,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2674, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4060, PETRI_PLACES=158, PETRI_TRANSITIONS=321} [2023-01-27 20:54:32,986 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2023-01-27 20:54:32,986 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 321 transitions, 4060 flow [2023-01-27 20:54:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 245.0) internal successors, (5145), 21 states have internal predecessors, (5145), 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) [2023-01-27 20:54:32,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:32,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:32,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 20:54:33,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:33,191 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:33,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -927665921, now seen corresponding path program 4 times [2023-01-27 20:54:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711691585] [2023-01-27 20:54:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711691585] [2023-01-27 20:54:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711691585] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194685993] [2023-01-27 20:54:34,170 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 20:54:34,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:34,171 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) [2023-01-27 20:54:34,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 20:54:34,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 20:54:34,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:34,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-27 20:54:34,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:34,579 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 137 treesize of output 101 [2023-01-27 20:54:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:34,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:35,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:35,395 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 253 treesize of output 221 [2023-01-27 20:54:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:35,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194685993] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:35,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:35,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2023-01-27 20:54:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621006796] [2023-01-27 20:54:35,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:35,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 20:54:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 20:54:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-01-27 20:54:35,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-27 20:54:35,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 321 transitions, 4060 flow. Second operand has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 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) [2023-01-27 20:54:35,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:35,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-27 20:54:35,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:38,459 INFO L130 PetriNetUnfolder]: 765/1390 cut-off events. [2023-01-27 20:54:38,460 INFO L131 PetriNetUnfolder]: For 9688/9688 co-relation queries the response was YES. [2023-01-27 20:54:38,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8966 conditions, 1390 events. 765/1390 cut-off events. For 9688/9688 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7367 event pairs, 9 based on Foata normal form. 14/1404 useless extension candidates. Maximal degree in co-relation 8833. Up to 368 conditions per place. [2023-01-27 20:54:38,469 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 139 selfloop transitions, 322 changer transitions 16/477 dead transitions. [2023-01-27 20:54:38,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 477 transitions, 6110 flow [2023-01-27 20:54:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-01-27 20:54:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-01-27 20:54:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 12167 transitions. [2023-01-27 20:54:38,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3271490414347557 [2023-01-27 20:54:38,479 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 12167 transitions. [2023-01-27 20:54:38,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 12167 transitions. [2023-01-27 20:54:38,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:38,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 12167 transitions. [2023-01-27 20:54:38,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 248.30612244897958) internal successors, (12167), 49 states have internal predecessors, (12167), 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) [2023-01-27 20:54:38,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 759.0) internal successors, (37950), 50 states have internal predecessors, (37950), 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) [2023-01-27 20:54:38,513 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 759.0) internal successors, (37950), 50 states have internal predecessors, (37950), 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) [2023-01-27 20:54:38,513 INFO L175 Difference]: Start difference. First operand has 158 places, 321 transitions, 4060 flow. Second operand 49 states and 12167 transitions. [2023-01-27 20:54:38,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 477 transitions, 6110 flow [2023-01-27 20:54:38,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 477 transitions, 5786 flow, removed 82 selfloop flow, removed 21 redundant places. [2023-01-27 20:54:38,558 INFO L231 Difference]: Finished difference. Result has 181 places, 360 transitions, 5031 flow [2023-01-27 20:54:38,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5031, PETRI_PLACES=181, PETRI_TRANSITIONS=360} [2023-01-27 20:54:38,559 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 161 predicate places. [2023-01-27 20:54:38,559 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 360 transitions, 5031 flow [2023-01-27 20:54:38,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 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) [2023-01-27 20:54:38,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:38,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:38,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-27 20:54:38,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-27 20:54:38,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:38,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1874892425, now seen corresponding path program 5 times [2023-01-27 20:54:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:38,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495181334] [2023-01-27 20:54:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:39,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495181334] [2023-01-27 20:54:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495181334] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114969237] [2023-01-27 20:54:39,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 20:54:39,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:39,745 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) [2023-01-27 20:54:39,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 20:54:39,841 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 20:54:39,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:39,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-27 20:54:39,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:40,178 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 123 treesize of output 103 [2023-01-27 20:54:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:40,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:40,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:40,735 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 339 treesize of output 251 [2023-01-27 20:54:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114969237] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:41,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:41,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-01-27 20:54:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830916042] [2023-01-27 20:54:41,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:41,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-27 20:54:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-27 20:54:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-01-27 20:54:41,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 759 [2023-01-27 20:54:41,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 360 transitions, 5031 flow. Second operand has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 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) [2023-01-27 20:54:41,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:41,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 759 [2023-01-27 20:54:41,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:42,316 INFO L130 PetriNetUnfolder]: 747/1400 cut-off events. [2023-01-27 20:54:42,316 INFO L131 PetriNetUnfolder]: For 9064/9064 co-relation queries the response was YES. [2023-01-27 20:54:42,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 1400 events. 747/1400 cut-off events. For 9064/9064 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7661 event pairs, 10 based on Foata normal form. 12/1412 useless extension candidates. Maximal degree in co-relation 9549. Up to 377 conditions per place. [2023-01-27 20:54:42,326 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 174 selfloop transitions, 255 changer transitions 12/441 dead transitions. [2023-01-27 20:54:42,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 441 transitions, 6447 flow [2023-01-27 20:54:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 20:54:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 20:54:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 6912 transitions. [2023-01-27 20:54:42,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3372859025032938 [2023-01-27 20:54:42,332 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 6912 transitions. [2023-01-27 20:54:42,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 6912 transitions. [2023-01-27 20:54:42,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:42,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 6912 transitions. [2023-01-27 20:54:42,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 256.0) internal successors, (6912), 27 states have internal predecessors, (6912), 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) [2023-01-27 20:54:42,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 759.0) internal successors, (21252), 28 states have internal predecessors, (21252), 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) [2023-01-27 20:54:42,346 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 759.0) internal successors, (21252), 28 states have internal predecessors, (21252), 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) [2023-01-27 20:54:42,347 INFO L175 Difference]: Start difference. First operand has 181 places, 360 transitions, 5031 flow. Second operand 27 states and 6912 transitions. [2023-01-27 20:54:42,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 441 transitions, 6447 flow [2023-01-27 20:54:42,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 441 transitions, 5743 flow, removed 260 selfloop flow, removed 28 redundant places. [2023-01-27 20:54:42,406 INFO L231 Difference]: Finished difference. Result has 183 places, 368 transitions, 5243 flow [2023-01-27 20:54:42,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4089, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5243, PETRI_PLACES=183, PETRI_TRANSITIONS=368} [2023-01-27 20:54:42,406 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 163 predicate places. [2023-01-27 20:54:42,406 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 368 transitions, 5243 flow [2023-01-27 20:54:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 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) [2023-01-27 20:54:42,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:42,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:42,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-27 20:54:42,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:42,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:42,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1562389633, now seen corresponding path program 6 times [2023-01-27 20:54:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:42,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406770681] [2023-01-27 20:54:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406770681] [2023-01-27 20:54:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406770681] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862726928] [2023-01-27 20:54:43,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 20:54:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:43,525 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) [2023-01-27 20:54:43,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 20:54:43,657 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 20:54:43,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:43,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 66 conjunts are in the unsatisfiable core [2023-01-27 20:54:43,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:43,690 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 [2023-01-27 20:54:43,752 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 [2023-01-27 20:54:43,811 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 [2023-01-27 20:54:44,037 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 123 treesize of output 103 [2023-01-27 20:54:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:44,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:44,943 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (<= (+ 2 c_~i~0) c_~N~0)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4))) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) .cse0 (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse1)) (< (+ c_~bag2~0 .cse1 2147483648) 0) (= (+ (select .cse2 .cse3) c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse1 c_~sum2~0)))))) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (or .cse0 (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse3)) (.cse6 (select .cse7 .cse4))) (or (< 2147483647 (+ .cse5 c_~bag1~0)) (< (+ .cse5 c_~bag1~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse6)) (< (+ c_~bag2~0 .cse6 2147483648) 0) (= (+ .cse5 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse6 c_~sum2~0))))))))) (<= c_~N~0 c_~j~0)) is different from false [2023-01-27 20:54:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862726928] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:45,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2023-01-27 20:54:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173887930] [2023-01-27 20:54:45,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 20:54:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:45,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 20:54:45,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=383, Unknown=1, NotChecked=40, Total=506 [2023-01-27 20:54:45,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-27 20:54:45,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 368 transitions, 5243 flow. Second operand has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 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) [2023-01-27 20:54:45,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:45,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-27 20:54:45,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:46,575 INFO L130 PetriNetUnfolder]: 709/1330 cut-off events. [2023-01-27 20:54:46,575 INFO L131 PetriNetUnfolder]: For 6999/6999 co-relation queries the response was YES. [2023-01-27 20:54:46,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 1330 events. 709/1330 cut-off events. For 6999/6999 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7208 event pairs, 23 based on Foata normal form. 6/1336 useless extension candidates. Maximal degree in co-relation 8878. Up to 477 conditions per place. [2023-01-27 20:54:46,584 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 142 selfloop transitions, 260 changer transitions 11/413 dead transitions. [2023-01-27 20:54:46,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 413 transitions, 6116 flow [2023-01-27 20:54:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-27 20:54:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-01-27 20:54:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6456 transitions. [2023-01-27 20:54:46,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32715110975980544 [2023-01-27 20:54:46,590 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 6456 transitions. [2023-01-27 20:54:46,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 6456 transitions. [2023-01-27 20:54:46,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:46,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 6456 transitions. [2023-01-27 20:54:46,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 248.30769230769232) internal successors, (6456), 26 states have internal predecessors, (6456), 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) [2023-01-27 20:54:46,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 759.0) internal successors, (20493), 27 states have internal predecessors, (20493), 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) [2023-01-27 20:54:46,603 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 759.0) internal successors, (20493), 27 states have internal predecessors, (20493), 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) [2023-01-27 20:54:46,603 INFO L175 Difference]: Start difference. First operand has 183 places, 368 transitions, 5243 flow. Second operand 26 states and 6456 transitions. [2023-01-27 20:54:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 413 transitions, 6116 flow [2023-01-27 20:54:46,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 413 transitions, 5954 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-01-27 20:54:46,649 INFO L231 Difference]: Finished difference. Result has 197 places, 360 transitions, 5485 flow [2023-01-27 20:54:46,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4637, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5485, PETRI_PLACES=197, PETRI_TRANSITIONS=360} [2023-01-27 20:54:46,649 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 177 predicate places. [2023-01-27 20:54:46,649 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 360 transitions, 5485 flow [2023-01-27 20:54:46,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 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) [2023-01-27 20:54:46,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:46,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:46,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 20:54:46,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:46,855 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:46,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1901055643, now seen corresponding path program 7 times [2023-01-27 20:54:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887150461] [2023-01-27 20:54:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887150461] [2023-01-27 20:54:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887150461] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134145422] [2023-01-27 20:54:47,582 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 20:54:47,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:47,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:47,583 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) [2023-01-27 20:54:47,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 20:54:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:47,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-27 20:54:47,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:47,905 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 123 treesize of output 103 [2023-01-27 20:54:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:47,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:48,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:48,453 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 339 treesize of output 251 [2023-01-27 20:54:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:48,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134145422] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:48,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2023-01-27 20:54:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569959153] [2023-01-27 20:54:48,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:48,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-27 20:54:48,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:48,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-27 20:54:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-01-27 20:54:48,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-27 20:54:48,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 360 transitions, 5485 flow. Second operand has 19 states, 19 states have (on average 245.21052631578948) internal successors, (4659), 19 states have internal predecessors, (4659), 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) [2023-01-27 20:54:48,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:48,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-27 20:54:48,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:49,271 INFO L130 PetriNetUnfolder]: 712/1329 cut-off events. [2023-01-27 20:54:49,271 INFO L131 PetriNetUnfolder]: For 7286/7286 co-relation queries the response was YES. [2023-01-27 20:54:49,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9672 conditions, 1329 events. 712/1329 cut-off events. For 7286/7286 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7191 event pairs, 41 based on Foata normal form. 2/1331 useless extension candidates. Maximal degree in co-relation 9549. Up to 778 conditions per place. [2023-01-27 20:54:49,280 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 302 selfloop transitions, 87 changer transitions 8/397 dead transitions. [2023-01-27 20:54:49,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 397 transitions, 6460 flow [2023-01-27 20:54:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-27 20:54:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-27 20:54:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4237 transitions. [2023-01-27 20:54:49,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3283732465318143 [2023-01-27 20:54:49,283 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4237 transitions. [2023-01-27 20:54:49,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4237 transitions. [2023-01-27 20:54:49,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:49,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4237 transitions. [2023-01-27 20:54:49,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 249.23529411764707) internal successors, (4237), 17 states have internal predecessors, (4237), 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) [2023-01-27 20:54:49,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 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) [2023-01-27 20:54:49,293 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 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) [2023-01-27 20:54:49,293 INFO L175 Difference]: Start difference. First operand has 197 places, 360 transitions, 5485 flow. Second operand 17 states and 4237 transitions. [2023-01-27 20:54:49,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 397 transitions, 6460 flow [2023-01-27 20:54:49,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 397 transitions, 6393 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-01-27 20:54:49,343 INFO L231 Difference]: Finished difference. Result has 205 places, 360 transitions, 5641 flow [2023-01-27 20:54:49,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5422, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5641, PETRI_PLACES=205, PETRI_TRANSITIONS=360} [2023-01-27 20:54:49,343 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 185 predicate places. [2023-01-27 20:54:49,343 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 360 transitions, 5641 flow [2023-01-27 20:54:49,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 245.21052631578948) internal successors, (4659), 19 states have internal predecessors, (4659), 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) [2023-01-27 20:54:49,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:49,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:49,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-27 20:54:49,548 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,SelfDestructingSolverStorable12 [2023-01-27 20:54:49,549 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:49,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1100080267, now seen corresponding path program 8 times [2023-01-27 20:54:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:49,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855589571] [2023-01-27 20:54:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855589571] [2023-01-27 20:54:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855589571] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239207961] [2023-01-27 20:54:50,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:54:50,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:50,223 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) [2023-01-27 20:54:50,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 20:54:50,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:54:50,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:50,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2023-01-27 20:54:50,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:50,345 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 [2023-01-27 20:54:50,382 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 [2023-01-27 20:54:50,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:54:50,524 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 [2023-01-27 20:54:50,642 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 137 treesize of output 101 [2023-01-27 20:54:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:50,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:51,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:51,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 97 treesize of output 61 [2023-01-27 20:54:51,729 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 228 treesize of output 204 [2023-01-27 20:54:51,736 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 69 treesize of output 63 [2023-01-27 20:54:51,740 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 128 treesize of output 116 [2023-01-27 20:54:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239207961] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:51,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-01-27 20:54:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899225694] [2023-01-27 20:54:51,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:51,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-27 20:54:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:51,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-27 20:54:51,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=506, Unknown=1, NotChecked=0, Total=600 [2023-01-27 20:54:51,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-27 20:54:51,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 360 transitions, 5641 flow. Second operand has 25 states, 25 states have (on average 244.72) internal successors, (6118), 25 states have internal predecessors, (6118), 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) [2023-01-27 20:54:51,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:51,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-27 20:54:51,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:54:53,468 INFO L130 PetriNetUnfolder]: 751/1412 cut-off events. [2023-01-27 20:54:53,469 INFO L131 PetriNetUnfolder]: For 8009/8009 co-relation queries the response was YES. [2023-01-27 20:54:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10450 conditions, 1412 events. 751/1412 cut-off events. For 8009/8009 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7867 event pairs, 21 based on Foata normal form. 2/1414 useless extension candidates. Maximal degree in co-relation 10326. Up to 483 conditions per place. [2023-01-27 20:54:53,480 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 222 selfloop transitions, 208 changer transitions 8/438 dead transitions. [2023-01-27 20:54:53,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 438 transitions, 7142 flow [2023-01-27 20:54:53,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-27 20:54:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-27 20:54:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5734 transitions. [2023-01-27 20:54:53,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3284642263848313 [2023-01-27 20:54:53,490 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5734 transitions. [2023-01-27 20:54:53,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5734 transitions. [2023-01-27 20:54:53,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:54:53,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5734 transitions. [2023-01-27 20:54:53,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 249.30434782608697) internal successors, (5734), 23 states have internal predecessors, (5734), 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) [2023-01-27 20:54:53,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 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) [2023-01-27 20:54:53,509 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 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) [2023-01-27 20:54:53,509 INFO L175 Difference]: Start difference. First operand has 205 places, 360 transitions, 5641 flow. Second operand 23 states and 5734 transitions. [2023-01-27 20:54:53,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 438 transitions, 7142 flow [2023-01-27 20:54:53,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 438 transitions, 6900 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-01-27 20:54:53,563 INFO L231 Difference]: Finished difference. Result has 215 places, 379 transitions, 6199 flow [2023-01-27 20:54:53,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5413, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6199, PETRI_PLACES=215, PETRI_TRANSITIONS=379} [2023-01-27 20:54:53,564 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 195 predicate places. [2023-01-27 20:54:53,564 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 379 transitions, 6199 flow [2023-01-27 20:54:53,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 244.72) internal successors, (6118), 25 states have internal predecessors, (6118), 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) [2023-01-27 20:54:53,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:54:53,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:54:53,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-27 20:54:53,769 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,SelfDestructingSolverStorable13 [2023-01-27 20:54:53,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:54:53,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:54:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 761414257, now seen corresponding path program 9 times [2023-01-27 20:54:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:54:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193227038] [2023-01-27 20:54:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:54:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:54:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:54:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:54:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:54:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193227038] [2023-01-27 20:54:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193227038] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:54:54,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410318027] [2023-01-27 20:54:54,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 20:54:54,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:54:54,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:54:54,626 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) [2023-01-27 20:54:54,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 20:54:54,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 20:54:54,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:54:54,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-27 20:54:54,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:54:54,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:54:54,906 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 [2023-01-27 20:54:55,029 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 137 treesize of output 101 [2023-01-27 20:54:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:55,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:54:55,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:54:55,827 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 317 treesize of output 285 [2023-01-27 20:54:55,839 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 50 treesize of output 32 [2023-01-27 20:54:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:54:56,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410318027] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:54:56,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:54:56,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-01-27 20:54:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89927098] [2023-01-27 20:54:56,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:54:56,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 20:54:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:54:56,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 20:54:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=535, Unknown=1, NotChecked=0, Total=650 [2023-01-27 20:54:56,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 759 [2023-01-27 20:54:56,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 379 transitions, 6199 flow. Second operand has 26 states, 26 states have (on average 247.76923076923077) internal successors, (6442), 26 states have internal predecessors, (6442), 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) [2023-01-27 20:54:56,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:54:56,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 759 [2023-01-27 20:54:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:55:50,292 WARN L222 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:56:02,733 WARN L222 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 61 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:56:11,043 WARN L222 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 79 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:56:23,444 WARN L222 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:56:23,658 INFO L130 PetriNetUnfolder]: 851/1609 cut-off events. [2023-01-27 20:56:23,658 INFO L131 PetriNetUnfolder]: For 10811/10811 co-relation queries the response was YES. [2023-01-27 20:56:23,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12261 conditions, 1609 events. 851/1609 cut-off events. For 10811/10811 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9208 event pairs, 5 based on Foata normal form. 3/1612 useless extension candidates. Maximal degree in co-relation 12145. Up to 507 conditions per place. [2023-01-27 20:56:23,678 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 175 selfloop transitions, 366 changer transitions 10/551 dead transitions. [2023-01-27 20:56:23,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 551 transitions, 8782 flow [2023-01-27 20:56:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-27 20:56:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-01-27 20:56:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 14288 transitions. [2023-01-27 20:56:23,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302591128678085 [2023-01-27 20:56:23,687 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 14288 transitions. [2023-01-27 20:56:23,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 14288 transitions. [2023-01-27 20:56:23,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:23,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 14288 transitions. [2023-01-27 20:56:23,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 250.66666666666666) internal successors, (14288), 57 states have internal predecessors, (14288), 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) [2023-01-27 20:56:23,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 759.0) internal successors, (44022), 58 states have internal predecessors, (44022), 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) [2023-01-27 20:56:23,722 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 759.0) internal successors, (44022), 58 states have internal predecessors, (44022), 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) [2023-01-27 20:56:23,722 INFO L175 Difference]: Start difference. First operand has 215 places, 379 transitions, 6199 flow. Second operand 57 states and 14288 transitions. [2023-01-27 20:56:23,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 551 transitions, 8782 flow [2023-01-27 20:56:23,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 551 transitions, 8656 flow, removed 10 selfloop flow, removed 14 redundant places. [2023-01-27 20:56:23,786 INFO L231 Difference]: Finished difference. Result has 264 places, 438 transitions, 7875 flow [2023-01-27 20:56:23,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=6085, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=7875, PETRI_PLACES=264, PETRI_TRANSITIONS=438} [2023-01-27 20:56:23,787 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 244 predicate places. [2023-01-27 20:56:23,787 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 438 transitions, 7875 flow [2023-01-27 20:56:23,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 247.76923076923077) internal successors, (6442), 26 states have internal predecessors, (6442), 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) [2023-01-27 20:56:23,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:23,788 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:23,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 20:56:23,993 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,SelfDestructingSolverStorable14 [2023-01-27 20:56:23,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:56:23,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash 681692873, now seen corresponding path program 10 times [2023-01-27 20:56:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:23,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259278995] [2023-01-27 20:56:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259278995] [2023-01-27 20:56:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259278995] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406204518] [2023-01-27 20:56:24,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 20:56:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:24,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:24,097 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) [2023-01-27 20:56:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 20:56:24,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 20:56:24,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:56:24,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:56:24,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:24,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:24,497 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 209 treesize of output 193 [2023-01-27 20:56:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406204518] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:56:24,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:56:24,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-01-27 20:56:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190476919] [2023-01-27 20:56:24,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:56:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 20:56:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 20:56:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-01-27 20:56:24,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 759 [2023-01-27 20:56:24,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 438 transitions, 7875 flow. Second operand has 15 states, 15 states have (on average 274.8666666666667) internal successors, (4123), 15 states have internal predecessors, (4123), 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) [2023-01-27 20:56:24,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:24,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 759 [2023-01-27 20:56:24,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:25,095 INFO L130 PetriNetUnfolder]: 772/1470 cut-off events. [2023-01-27 20:56:25,095 INFO L131 PetriNetUnfolder]: For 11125/11125 co-relation queries the response was YES. [2023-01-27 20:56:25,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11781 conditions, 1470 events. 772/1470 cut-off events. For 11125/11125 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8265 event pairs, 127 based on Foata normal form. 79/1549 useless extension candidates. Maximal degree in co-relation 11724. Up to 668 conditions per place. [2023-01-27 20:56:25,105 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 231 selfloop transitions, 211 changer transitions 0/442 dead transitions. [2023-01-27 20:56:25,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 442 transitions, 8116 flow [2023-01-27 20:56:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-27 20:56:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-27 20:56:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4721 transitions. [2023-01-27 20:56:25,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3658839029683019 [2023-01-27 20:56:25,108 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4721 transitions. [2023-01-27 20:56:25,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4721 transitions. [2023-01-27 20:56:25,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:25,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4721 transitions. [2023-01-27 20:56:25,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 277.70588235294116) internal successors, (4721), 17 states have internal predecessors, (4721), 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) [2023-01-27 20:56:25,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 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) [2023-01-27 20:56:25,117 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 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) [2023-01-27 20:56:25,117 INFO L175 Difference]: Start difference. First operand has 264 places, 438 transitions, 7875 flow. Second operand 17 states and 4721 transitions. [2023-01-27 20:56:25,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 442 transitions, 8116 flow [2023-01-27 20:56:25,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 442 transitions, 7513 flow, removed 97 selfloop flow, removed 31 redundant places. [2023-01-27 20:56:25,177 INFO L231 Difference]: Finished difference. Result has 237 places, 396 transitions, 6806 flow [2023-01-27 20:56:25,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=6003, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6806, PETRI_PLACES=237, PETRI_TRANSITIONS=396} [2023-01-27 20:56:25,178 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 217 predicate places. [2023-01-27 20:56:25,178 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 396 transitions, 6806 flow [2023-01-27 20:56:25,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 274.8666666666667) internal successors, (4123), 15 states have internal predecessors, (4123), 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) [2023-01-27 20:56:25,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:25,178 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:25,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 20:56:25,383 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,SelfDestructingSolverStorable15 [2023-01-27 20:56:25,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:56:25,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1250955687, now seen corresponding path program 11 times [2023-01-27 20:56:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712865684] [2023-01-27 20:56:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712865684] [2023-01-27 20:56:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712865684] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537204668] [2023-01-27 20:56:25,487 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 20:56:25,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:25,488 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) [2023-01-27 20:56:25,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 20:56:25,580 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:56:25,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:56:25,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:56:25,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:25,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:26,047 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 20:56:26,048 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 353 treesize of output 249 [2023-01-27 20:56:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537204668] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:56:26,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:56:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-01-27 20:56:26,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385052936] [2023-01-27 20:56:26,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:56:26,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 20:56:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:26,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 20:56:26,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-01-27 20:56:26,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 759 [2023-01-27 20:56:26,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 396 transitions, 6806 flow. Second operand has 13 states, 13 states have (on average 266.7692307692308) internal successors, (3468), 13 states have internal predecessors, (3468), 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) [2023-01-27 20:56:26,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:26,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 759 [2023-01-27 20:56:26,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:26,446 INFO L130 PetriNetUnfolder]: 526/1076 cut-off events. [2023-01-27 20:56:26,446 INFO L131 PetriNetUnfolder]: For 6646/6646 co-relation queries the response was YES. [2023-01-27 20:56:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8586 conditions, 1076 events. 526/1076 cut-off events. For 6646/6646 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5896 event pairs, 97 based on Foata normal form. 82/1158 useless extension candidates. Maximal degree in co-relation 8541. Up to 409 conditions per place. [2023-01-27 20:56:26,452 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 260 selfloop transitions, 49 changer transitions 19/328 dead transitions. [2023-01-27 20:56:26,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 328 transitions, 6155 flow [2023-01-27 20:56:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 20:56:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 20:56:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2163 transitions. [2023-01-27 20:56:26,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35622529644268774 [2023-01-27 20:56:26,454 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2163 transitions. [2023-01-27 20:56:26,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2163 transitions. [2023-01-27 20:56:26,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:26,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2163 transitions. [2023-01-27 20:56:26,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 270.375) internal successors, (2163), 8 states have internal predecessors, (2163), 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) [2023-01-27 20:56:26,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 759.0) internal successors, (6831), 9 states have internal predecessors, (6831), 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) [2023-01-27 20:56:26,458 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 759.0) internal successors, (6831), 9 states have internal predecessors, (6831), 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) [2023-01-27 20:56:26,458 INFO L175 Difference]: Start difference. First operand has 237 places, 396 transitions, 6806 flow. Second operand 8 states and 2163 transitions. [2023-01-27 20:56:26,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 328 transitions, 6155 flow [2023-01-27 20:56:26,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 328 transitions, 5838 flow, removed 26 selfloop flow, removed 18 redundant places. [2023-01-27 20:56:26,531 INFO L231 Difference]: Finished difference. Result has 224 places, 295 transitions, 5022 flow [2023-01-27 20:56:26,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5125, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5022, PETRI_PLACES=224, PETRI_TRANSITIONS=295} [2023-01-27 20:56:26,532 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 204 predicate places. [2023-01-27 20:56:26,532 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 295 transitions, 5022 flow [2023-01-27 20:56:26,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 266.7692307692308) internal successors, (3468), 13 states have internal predecessors, (3468), 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) [2023-01-27 20:56:26,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:26,533 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:26,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-27 20:56:26,737 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,SelfDestructingSolverStorable16 [2023-01-27 20:56:26,737 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:56:26,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash 265595398, now seen corresponding path program 12 times [2023-01-27 20:56:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:26,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335852853] [2023-01-27 20:56:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:26,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335852853] [2023-01-27 20:56:26,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335852853] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629581844] [2023-01-27 20:56:26,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 20:56:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:26,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:26,832 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) [2023-01-27 20:56:26,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 20:56:26,931 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-27 20:56:26,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:56:26,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 20:56:26,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:27,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:27,711 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 20:56:27,712 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 237 treesize of output 205 [2023-01-27 20:56:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629581844] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:56:27,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:56:27,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2023-01-27 20:56:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830209111] [2023-01-27 20:56:27,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:56:27,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 20:56:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 20:56:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-01-27 20:56:27,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 759 [2023-01-27 20:56:27,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 295 transitions, 5022 flow. Second operand has 13 states, 13 states have (on average 255.0) internal successors, (3315), 13 states have internal predecessors, (3315), 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) [2023-01-27 20:56:27,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:27,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 759 [2023-01-27 20:56:27,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:28,094 INFO L130 PetriNetUnfolder]: 376/729 cut-off events. [2023-01-27 20:56:28,095 INFO L131 PetriNetUnfolder]: For 5282/5282 co-relation queries the response was YES. [2023-01-27 20:56:28,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 729 events. 376/729 cut-off events. For 5282/5282 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3314 event pairs, 16 based on Foata normal form. 19/748 useless extension candidates. Maximal degree in co-relation 5556. Up to 250 conditions per place. [2023-01-27 20:56:28,119 INFO L137 encePairwiseOnDemand]: 750/759 looper letters, 131 selfloop transitions, 91 changer transitions 29/251 dead transitions. [2023-01-27 20:56:28,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 4085 flow [2023-01-27 20:56:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-27 20:56:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-27 20:56:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4379 transitions. [2023-01-27 20:56:28,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33937843912268467 [2023-01-27 20:56:28,122 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4379 transitions. [2023-01-27 20:56:28,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4379 transitions. [2023-01-27 20:56:28,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:28,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4379 transitions. [2023-01-27 20:56:28,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 257.5882352941176) internal successors, (4379), 17 states have internal predecessors, (4379), 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) [2023-01-27 20:56:28,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 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) [2023-01-27 20:56:28,130 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 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) [2023-01-27 20:56:28,130 INFO L175 Difference]: Start difference. First operand has 224 places, 295 transitions, 5022 flow. Second operand 17 states and 4379 transitions. [2023-01-27 20:56:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 4085 flow [2023-01-27 20:56:28,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 251 transitions, 3835 flow, removed 9 selfloop flow, removed 27 redundant places. [2023-01-27 20:56:28,153 INFO L231 Difference]: Finished difference. Result has 171 places, 188 transitions, 3133 flow [2023-01-27 20:56:28,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3133, PETRI_PLACES=171, PETRI_TRANSITIONS=188} [2023-01-27 20:56:28,154 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 151 predicate places. [2023-01-27 20:56:28,154 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 188 transitions, 3133 flow [2023-01-27 20:56:28,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 255.0) internal successors, (3315), 13 states have internal predecessors, (3315), 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) [2023-01-27 20:56:28,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:28,154 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:28,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-27 20:56:28,359 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,SelfDestructingSolverStorable17 [2023-01-27 20:56:28,359 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:56:28,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1735114768, now seen corresponding path program 13 times [2023-01-27 20:56:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426299400] [2023-01-27 20:56:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 20:56:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426299400] [2023-01-27 20:56:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426299400] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156099939] [2023-01-27 20:56:31,020 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 20:56:31,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:31,021 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) [2023-01-27 20:56:31,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-27 20:56:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:31,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-27 20:56:31,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:32,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:56:32,113 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 240 treesize of output 160 [2023-01-27 20:56:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:56:32,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:34,946 INFO L321 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-01-27 20:56:34,947 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 1173 treesize of output 585 [2023-01-27 20:56:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 20:56:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156099939] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:56:44,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:56:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2023-01-27 20:56:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929601327] [2023-01-27 20:56:44,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:56:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 20:56:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:44,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 20:56:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2023-01-27 20:56:44,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 759 [2023-01-27 20:56:44,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 188 transitions, 3133 flow. Second operand has 26 states, 26 states have (on average 240.1153846153846) internal successors, (6243), 26 states have internal predecessors, (6243), 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) [2023-01-27 20:56:44,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:44,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 759 [2023-01-27 20:56:44,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:46,013 INFO L130 PetriNetUnfolder]: 527/937 cut-off events. [2023-01-27 20:56:46,013 INFO L131 PetriNetUnfolder]: For 9133/9133 co-relation queries the response was YES. [2023-01-27 20:56:46,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7753 conditions, 937 events. 527/937 cut-off events. For 9133/9133 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4348 event pairs, 18 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 7711. Up to 527 conditions per place. [2023-01-27 20:56:46,019 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 171 selfloop transitions, 132 changer transitions 8/311 dead transitions. [2023-01-27 20:56:46,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 311 transitions, 5336 flow [2023-01-27 20:56:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-27 20:56:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-27 20:56:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5592 transitions. [2023-01-27 20:56:46,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32032995360027494 [2023-01-27 20:56:46,049 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5592 transitions. [2023-01-27 20:56:46,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5592 transitions. [2023-01-27 20:56:46,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:46,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5592 transitions. [2023-01-27 20:56:46,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 243.1304347826087) internal successors, (5592), 23 states have internal predecessors, (5592), 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) [2023-01-27 20:56:46,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 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) [2023-01-27 20:56:46,061 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 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) [2023-01-27 20:56:46,061 INFO L175 Difference]: Start difference. First operand has 171 places, 188 transitions, 3133 flow. Second operand 23 states and 5592 transitions. [2023-01-27 20:56:46,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 311 transitions, 5336 flow [2023-01-27 20:56:46,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 311 transitions, 5120 flow, removed 22 selfloop flow, removed 12 redundant places. [2023-01-27 20:56:46,100 INFO L231 Difference]: Finished difference. Result has 160 places, 250 transitions, 4498 flow [2023-01-27 20:56:46,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4498, PETRI_PLACES=160, PETRI_TRANSITIONS=250} [2023-01-27 20:56:46,101 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 140 predicate places. [2023-01-27 20:56:46,101 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 250 transitions, 4498 flow [2023-01-27 20:56:46,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 240.1153846153846) internal successors, (6243), 26 states have internal predecessors, (6243), 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) [2023-01-27 20:56:46,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:46,102 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:46,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-27 20:56:46,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:46,309 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:56:46,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:46,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1929977428, now seen corresponding path program 14 times [2023-01-27 20:56:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043042545] [2023-01-27 20:56:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:49,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043042545] [2023-01-27 20:56:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043042545] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:49,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852873911] [2023-01-27 20:56:49,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:56:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:49,533 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) [2023-01-27 20:56:49,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-27 20:56:49,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:56:49,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:56:49,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 72 conjunts are in the unsatisfiable core [2023-01-27 20:56:49,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:50,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:56:50,166 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 60 treesize of output 56 [2023-01-27 20:56:51,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:56:51,286 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 221 treesize of output 149 [2023-01-27 20:56:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:51,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:55,572 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse32 (* c_~j~0 4))) (let ((.cse9 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse10 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse4 (+ c_~A~0.offset .cse32)) (.cse5 (+ c_~A~0.offset .cse32 4)) (.cse6 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (< (+ 2 c_~j~0) c_~N~0)) (.cse8 (<= c_~N~0 (+ c_~j~0 1))) (.cse19 (< (+ c_~i~0 1) c_~N~0))) (and (or (and (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse0 1)) (< (+ .cse1 c_~bag2~0 .cse2 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse0)) (= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2) (+ c_~bag1~0 c_~sum1~0 .cse0)) (< (+ c_~bag1~0 .cse0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse2)) (< 2147483647 (+ .cse1 c_~bag2~0 .cse2)) (< (+ c_~bag2~0 .cse2 2147483648) 0))))) .cse7 .cse8) (or .cse9 .cse10 (and (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse6)) (.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse11 1)) (< 2147483647 (+ c_~bag1~0 .cse11)) (< (+ .cse12 .cse13 2147483648) 0) (= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13) (+ c_~bag1~0 c_~sum1~0 .cse11)) (< (+ c_~bag1~0 .cse11 2147483648) 0) (< c_~bag2~0 (+ .cse12 1)) (< 2147483647 (+ c_~bag2~0 .cse13)))))) .cse7 .cse8) (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse6)) (.cse17 (select .cse18 .cse5)) (.cse15 (select .cse18 .cse4))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse15 2147483648) 0) (< c_~cap1~0 (+ c_~bag1~0 .cse16 1)) (< 2147483647 (+ c_~bag1~0 .cse16)) (< (+ .cse17 .cse15 2147483648) 0) (= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse15) (+ c_~bag1~0 c_~sum1~0 .cse16)) (< (+ c_~bag1~0 .cse16 2147483648) 0) (< 2147483647 (+ .cse17 .cse15)) (< 2147483647 (+ c_~bag2~0 .cse15)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse15)) (< (+ c_~bag2~0 .cse15 2147483648) 0))))) .cse7 .cse8)))) .cse19) (or (< 2147483647 c_~cap1~0) (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) (and (or (and (or .cse7 .cse8 (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse6)) (.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse20)) (< (+ .cse21 .cse22 2147483648) 0) (= (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) (+ c_~bag1~0 c_~sum1~0 .cse20)) (< c_~bag2~0 (+ .cse21 1)) (< 2147483647 (+ c_~bag2~0 .cse22))))))) (or .cse7 .cse8 (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse6)) (.cse26 (select .cse27 .cse5)) (.cse24 (select .cse27 .cse4))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse24 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse25)) (< (+ .cse26 .cse24 2147483648) 0) (= (+ .cse26 c_~bag2~0 c_~sum2~0 .cse24) (+ c_~bag1~0 c_~sum1~0 .cse25)) (< 2147483647 (+ .cse26 .cse24)) (< 2147483647 (+ c_~bag2~0 .cse24)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse24)) (< (+ c_~bag2~0 .cse24 2147483648) 0))))))) .cse9 .cse10) (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse5)) (.cse29 (select .cse31 .cse4))) (or (< (+ .cse28 c_~bag2~0 .cse29 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse30)) (= (+ .cse28 c_~bag2~0 c_~sum2~0 .cse29) (+ c_~bag1~0 c_~sum1~0 .cse30)) (< 2147483647 (+ c_~bag2~0 .cse29)) (< 2147483647 (+ .cse28 c_~bag2~0 .cse29)) (< (+ c_~bag2~0 .cse29 2147483648) 0))))) .cse7 .cse8)) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19)))) (<= c_~N~0 c_~i~0)) is different from false [2023-01-27 20:56:59,740 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 20:56:59,741 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 4550 treesize of output 2948 [2023-01-27 20:56:59,874 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:56:59,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2854 treesize of output 2782 [2023-01-27 20:57:00,007 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2775 treesize of output 2727 [2023-01-27 20:57:00,147 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2720 treesize of output 2660 [2023-01-27 20:57:00,286 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2653 treesize of output 2598 [2023-01-27 20:57:00,340 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 20:57:00,433 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2591 treesize of output 2512 [2023-01-27 20:57:00,558 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2505 treesize of output 2438 [2023-01-27 20:57:00,684 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2431 treesize of output 2376 [2023-01-27 20:57:00,808 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2369 treesize of output 2290 [2023-01-27 20:57:00,934 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:00,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2283 treesize of output 2216 [2023-01-27 20:57:00,995 INFO L208 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2023-01-27 20:57:01,065 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:01,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2209 treesize of output 2137 [2023-01-27 20:57:01,190 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:01,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2130 treesize of output 2082 [2023-01-27 20:57:01,313 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-27 20:57:01,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2075 treesize of output 2015 [2023-01-27 20:57:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:57:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852873911] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:57:04,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:57:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2023-01-27 20:57:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459678446] [2023-01-27 20:57:04,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:57:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-01-27 20:57:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:57:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-01-27 20:57:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1192, Unknown=1, NotChecked=72, Total=1482 [2023-01-27 20:57:04,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-27 20:57:04,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 250 transitions, 4498 flow. Second operand has 39 states, 39 states have (on average 232.48717948717947) internal successors, (9067), 39 states have internal predecessors, (9067), 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) [2023-01-27 20:57:04,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:57:04,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-27 20:57:04,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:58:05,891 INFO L130 PetriNetUnfolder]: 1503/2661 cut-off events. [2023-01-27 20:58:05,892 INFO L131 PetriNetUnfolder]: For 26526/26526 co-relation queries the response was YES. [2023-01-27 20:58:05,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22685 conditions, 2661 events. 1503/2661 cut-off events. For 26526/26526 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15819 event pairs, 2 based on Foata normal form. 18/2679 useless extension candidates. Maximal degree in co-relation 22640. Up to 860 conditions per place. [2023-01-27 20:58:05,907 INFO L137 encePairwiseOnDemand]: 747/759 looper letters, 268 selfloop transitions, 660 changer transitions 38/966 dead transitions. [2023-01-27 20:58:05,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 966 transitions, 16438 flow [2023-01-27 20:58:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-01-27 20:58:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-01-27 20:58:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 19385 transitions. [2023-01-27 20:58:05,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31146566406375525 [2023-01-27 20:58:05,919 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 19385 transitions. [2023-01-27 20:58:05,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 19385 transitions. [2023-01-27 20:58:05,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:58:05,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 19385 transitions. [2023-01-27 20:58:05,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 236.40243902439025) internal successors, (19385), 82 states have internal predecessors, (19385), 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) [2023-01-27 20:58:05,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 759.0) internal successors, (62997), 83 states have internal predecessors, (62997), 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) [2023-01-27 20:58:05,963 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 759.0) internal successors, (62997), 83 states have internal predecessors, (62997), 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) [2023-01-27 20:58:05,964 INFO L175 Difference]: Start difference. First operand has 160 places, 250 transitions, 4498 flow. Second operand 82 states and 19385 transitions. [2023-01-27 20:58:05,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 966 transitions, 16438 flow [2023-01-27 20:58:06,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 966 transitions, 15833 flow, removed 189 selfloop flow, removed 10 redundant places. [2023-01-27 20:58:06,110 INFO L231 Difference]: Finished difference. Result has 244 places, 730 transitions, 14508 flow [2023-01-27 20:58:06,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4213, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=14508, PETRI_PLACES=244, PETRI_TRANSITIONS=730} [2023-01-27 20:58:06,111 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 224 predicate places. [2023-01-27 20:58:06,111 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 730 transitions, 14508 flow [2023-01-27 20:58:06,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 232.48717948717947) internal successors, (9067), 39 states have internal predecessors, (9067), 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) [2023-01-27 20:58:06,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:58:06,112 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:58:06,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-27 20:58:06,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:58:06,317 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 20:58:06,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:58:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1040341450, now seen corresponding path program 15 times [2023-01-27 20:58:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:58:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060922737] [2023-01-27 20:58:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:58:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:58:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:58:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:58:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:58:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060922737] [2023-01-27 20:58:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060922737] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:58:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032903030] [2023-01-27 20:58:08,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 20:58:08,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:58:08,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:58:08,381 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) [2023-01-27 20:58:08,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-27 20:58:08,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 20:58:08,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:58:08,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 84 conjunts are in the unsatisfiable core [2023-01-27 20:58:08,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:58:08,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:58:08,699 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 [2023-01-27 20:58:09,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:58:09,336 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 319 treesize of output 191 [2023-01-27 20:58:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:58:09,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:58:17,380 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,381 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 2568 treesize of output 1822 [2023-01-27 20:58:17,458 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,458 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 1784 treesize of output 1697 [2023-01-27 20:58:17,533 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,533 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 1670 treesize of output 1607 [2023-01-27 20:58:17,607 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,608 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 1580 treesize of output 1505 [2023-01-27 20:58:17,691 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,692 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 1478 treesize of output 1427 [2023-01-27 20:58:17,776 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,776 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 1400 treesize of output 1325 [2023-01-27 20:58:17,860 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:58:17,860 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 1298 treesize of output 1235 [2023-01-27 20:59:24,325 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:59:24,326 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 1395 treesize of output 1003 [2023-01-27 20:59:24,458 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:59:24,458 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 902 treesize of output 839 [2023-01-27 20:59:24,515 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:59:24,516 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 812 treesize of output 725 [2023-01-27 20:59:24,576 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 20:59:24,576 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 698 treesize of output 623 [2023-01-27 20:59:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 20:59:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032903030] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:59:46,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:59:46,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2023-01-27 20:59:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940325709] [2023-01-27 20:59:46,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:59:46,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-27 20:59:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:59:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-27 20:59:46,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1152, Unknown=2, NotChecked=0, Total=1332 [2023-01-27 20:59:46,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-27 20:59:46,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 730 transitions, 14508 flow. Second operand has 37 states, 37 states have (on average 232.48648648648648) internal successors, (8602), 37 states have internal predecessors, (8602), 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) [2023-01-27 20:59:46,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:59:46,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-27 20:59:46,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:00:26,753 WARN L222 SmtUtils]: Spent 16.70s on a formula simplification. DAG size of input: 266 DAG size of output: 212 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:00:56,252 WARN L222 SmtUtils]: Spent 9.36s on a formula simplification. DAG size of input: 257 DAG size of output: 203 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:01:14,207 INFO L130 PetriNetUnfolder]: 2413/4253 cut-off events. [2023-01-27 21:01:14,207 INFO L131 PetriNetUnfolder]: For 70830/70830 co-relation queries the response was YES. [2023-01-27 21:01:14,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43532 conditions, 4253 events. 2413/4253 cut-off events. For 70830/70830 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27456 event pairs, 37 based on Foata normal form. 24/4277 useless extension candidates. Maximal degree in co-relation 43472. Up to 1274 conditions per place. [2023-01-27 21:01:14,236 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 439 selfloop transitions, 1063 changer transitions 24/1526 dead transitions. [2023-01-27 21:01:14,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1526 transitions, 31552 flow [2023-01-27 21:01:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-01-27 21:01:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2023-01-27 21:01:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 26712 transitions. [2023-01-27 21:01:14,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31144845919759345 [2023-01-27 21:01:14,253 INFO L72 ComplementDD]: Start complementDD. Operand 113 states and 26712 transitions. [2023-01-27 21:01:14,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 26712 transitions. [2023-01-27 21:01:14,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:14,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 113 states and 26712 transitions. [2023-01-27 21:01:14,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 114 states, 113 states have (on average 236.38938053097345) internal successors, (26712), 113 states have internal predecessors, (26712), 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) [2023-01-27 21:01:14,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 114 states, 114 states have (on average 759.0) internal successors, (86526), 114 states have internal predecessors, (86526), 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) [2023-01-27 21:01:14,317 INFO L81 ComplementDD]: Finished complementDD. Result has 114 states, 114 states have (on average 759.0) internal successors, (86526), 114 states have internal predecessors, (86526), 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) [2023-01-27 21:01:14,317 INFO L175 Difference]: Start difference. First operand has 244 places, 730 transitions, 14508 flow. Second operand 113 states and 26712 transitions. [2023-01-27 21:01:14,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1526 transitions, 31552 flow [2023-01-27 21:01:14,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1526 transitions, 29510 flow, removed 425 selfloop flow, removed 12 redundant places. [2023-01-27 21:01:14,739 INFO L231 Difference]: Finished difference. Result has 351 places, 1229 transitions, 26071 flow [2023-01-27 21:01:14,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=13305, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=608, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=26071, PETRI_PLACES=351, PETRI_TRANSITIONS=1229} [2023-01-27 21:01:14,740 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 331 predicate places. [2023-01-27 21:01:14,740 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1229 transitions, 26071 flow [2023-01-27 21:01:14,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 232.48648648648648) internal successors, (8602), 37 states have internal predecessors, (8602), 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) [2023-01-27 21:01:14,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:14,741 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:01:14,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-27 21:01:14,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:14,945 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:01:14,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1068047080, now seen corresponding path program 16 times [2023-01-27 21:01:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127059796] [2023-01-27 21:01:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:49,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127059796] [2023-01-27 21:01:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127059796] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64078921] [2023-01-27 21:01:49,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 21:01:49,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:49,596 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) [2023-01-27 21:01:49,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-27 21:01:49,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 21:01:49,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:01:49,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 69 conjunts are in the unsatisfiable core [2023-01-27 21:01:49,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:49,795 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 [2023-01-27 21:01:49,854 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 [2023-01-27 21:01:49,951 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 [2023-01-27 21:01:50,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:01:50,867 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 268 treesize of output 180 [2023-01-27 21:01:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:51,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:02:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:02:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64078921] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:02:06,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:02:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2023-01-27 21:02:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594300247] [2023-01-27 21:02:06,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:02:06,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 21:02:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:02:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 21:02:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=877, Unknown=3, NotChecked=0, Total=1056 [2023-01-27 21:02:06,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-27 21:02:06,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1229 transitions, 26071 flow. Second operand has 33 states, 33 states have (on average 232.63636363636363) internal successors, (7677), 33 states have internal predecessors, (7677), 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) [2023-01-27 21:02:06,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:02:06,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-27 21:02:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:02:56,815 WARN L222 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 268 DAG size of output: 264 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:03:03,432 WARN L222 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 280 DAG size of output: 272 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:03:04,507 INFO L130 PetriNetUnfolder]: 2210/3873 cut-off events. [2023-01-27 21:03:04,507 INFO L131 PetriNetUnfolder]: For 61034/61034 co-relation queries the response was YES. [2023-01-27 21:03:04,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40966 conditions, 3873 events. 2210/3873 cut-off events. For 61034/61034 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24433 event pairs, 35 based on Foata normal form. 17/3890 useless extension candidates. Maximal degree in co-relation 40895. Up to 1148 conditions per place. [2023-01-27 21:03:04,542 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 308 selfloop transitions, 992 changer transitions 23/1323 dead transitions. [2023-01-27 21:03:04,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1323 transitions, 29203 flow [2023-01-27 21:03:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-27 21:03:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-01-27 21:03:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 16518 transitions. [2023-01-27 21:03:04,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3108977978543196 [2023-01-27 21:03:04,552 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 16518 transitions. [2023-01-27 21:03:04,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 16518 transitions. [2023-01-27 21:03:04,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:03:04,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 16518 transitions. [2023-01-27 21:03:04,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 235.97142857142856) internal successors, (16518), 70 states have internal predecessors, (16518), 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) [2023-01-27 21:03:04,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 759.0) internal successors, (53889), 71 states have internal predecessors, (53889), 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) [2023-01-27 21:03:04,590 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 759.0) internal successors, (53889), 71 states have internal predecessors, (53889), 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) [2023-01-27 21:03:04,591 INFO L175 Difference]: Start difference. First operand has 351 places, 1229 transitions, 26071 flow. Second operand 70 states and 16518 transitions. [2023-01-27 21:03:04,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1323 transitions, 29203 flow [2023-01-27 21:03:05,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1323 transitions, 27195 flow, removed 917 selfloop flow, removed 24 redundant places. [2023-01-27 21:03:05,219 INFO L231 Difference]: Finished difference. Result has 380 places, 1154 transitions, 25275 flow [2023-01-27 21:03:05,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=19628, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=839, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=25275, PETRI_PLACES=380, PETRI_TRANSITIONS=1154} [2023-01-27 21:03:05,220 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 360 predicate places. [2023-01-27 21:03:05,220 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 1154 transitions, 25275 flow [2023-01-27 21:03:05,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 232.63636363636363) internal successors, (7677), 33 states have internal predecessors, (7677), 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) [2023-01-27 21:03:05,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:03:05,221 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:03:05,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-27 21:03:05,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:03:05,425 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:03:05,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:03:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -105131752, now seen corresponding path program 17 times [2023-01-27 21:03:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:03:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800784355] [2023-01-27 21:03:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:03:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:03:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:03:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:03:07,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:03:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800784355] [2023-01-27 21:03:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800784355] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:03:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337374956] [2023-01-27 21:03:07,236 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 21:03:07,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:03:07,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:03:07,237 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) [2023-01-27 21:03:07,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-27 21:03:07,350 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 21:03:07,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:03:07,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 97 conjunts are in the unsatisfiable core [2023-01-27 21:03:07,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:03:07,428 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 [2023-01-27 21:03:07,522 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 [2023-01-27 21:03:08,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:03:08,144 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 36 treesize of output 32 [2023-01-27 21:03:08,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:03:08,468 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 234 treesize of output 154 [2023-01-27 21:03:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:03:08,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:03:10,665 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (< (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648) 0)) (.cse2 (let ((.cse19 (* c_~j~0 4))) (let ((.cse7 (+ c_~bag1~0 c_~sum1~0 .cse1)) (.cse10 (+ c_~A~0.offset .cse19)) (.cse9 (+ c_~A~0.offset .cse19 4)) (.cse11 (< (+ 2 c_~j~0) c_~N~0)) (.cse12 (<= c_~N~0 (+ c_~j~0 1)))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse5 (select .cse8 .cse10)) (.cse6 (select .cse8 .cse9))) (or (< 2147483647 (+ c_~bag2~0 .cse5)) (= (+ c_~bag2~0 .cse5 .cse6 c_~sum2~0) .cse7) (< (+ .cse5 .cse6 2147483648) 0) (< c_~bag2~0 (+ .cse6 1)))))) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse10)) (.cse14 (select .cse15 .cse9))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 c_~sum2~0)) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse7) (< (+ .cse13 .cse14 2147483648) 0) (< (+ c_~bag2~0 .cse13 2147483648) 0) (< 2147483647 (+ .cse13 .cse14)))))) .cse11 .cse12)) (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse9)) (.cse16 (select .cse18 .cse10))) (or (< 2147483647 (+ c_~bag2~0 .cse16)) (= (+ c_~bag2~0 .cse16 .cse17 c_~sum2~0) .cse7) (< (+ c_~bag2~0 .cse16 .cse17 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse16 .cse17)) (< (+ c_~bag2~0 .cse16 2147483648) 0))))) .cse11 .cse12))))) (.cse3 (< (+ c_~i~0 1) c_~N~0)) (.cse4 (< 2147483647 |c_thread1Thread1of1ForFork0_#t~ret2#1|))) (and (or .cse0 (< 2147483647 (+ c_~bag1~0 .cse1)) .cse2 (<= c_~cap1~0 |c_thread1Thread1of1ForFork0_#t~ret2#1|) .cse3 (< (+ c_~bag1~0 .cse1 2147483648) 0) .cse4) (or .cse0 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0) (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) .cse2 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse3 .cse4)))) is different from false [2023-01-27 21:03:11,259 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (+ c_~bag1~0 .cse5))) (let ((.cse1 (< 2147483647 .cse0)) (.cse2 (let ((.cse20 (* c_~j~0 4))) (let ((.cse8 (+ c_~bag1~0 c_~sum1~0 .cse5)) (.cse11 (+ c_~A~0.offset .cse20)) (.cse10 (+ c_~A~0.offset .cse20 4)) (.cse12 (< (+ 2 c_~j~0) c_~N~0)) (.cse13 (<= c_~N~0 (+ c_~j~0 1)))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse6 (select .cse9 .cse11)) (.cse7 (select .cse9 .cse10))) (or (< 2147483647 (+ c_~bag2~0 .cse6)) (= (+ c_~bag2~0 .cse6 .cse7 c_~sum2~0) .cse8) (< (+ .cse6 .cse7 2147483648) 0) (< c_~bag2~0 (+ .cse7 1)))))) .cse12 .cse13) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse11)) (.cse15 (select .cse16 .cse10))) (or (< 2147483647 (+ c_~bag2~0 .cse14)) (< (+ c_~bag2~0 .cse14 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse14 c_~sum2~0)) (= (+ c_~bag2~0 .cse14 .cse15 c_~sum2~0) .cse8) (< (+ .cse14 .cse15 2147483648) 0) (< (+ c_~bag2~0 .cse14 2147483648) 0) (< 2147483647 (+ .cse14 .cse15)))))) .cse12 .cse13)) (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse10)) (.cse17 (select .cse19 .cse11))) (or (< 2147483647 (+ c_~bag2~0 .cse17)) (= (+ c_~bag2~0 .cse17 .cse18 c_~sum2~0) .cse8) (< (+ c_~bag2~0 .cse17 .cse18 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse17 .cse18)) (< (+ c_~bag2~0 .cse17 2147483648) 0))))) .cse12 .cse13))))) (.cse3 (< (+ c_~i~0 1) c_~N~0)) (.cse4 (< (+ c_~bag1~0 .cse5 2147483648) 0))) (and (or (< .cse0 c_~cap1~0) .cse1 (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) .cse2 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse3 .cse4) (or (<= c_~cap1~0 .cse0) .cse1 .cse2 .cse3 .cse4))))) (<= c_~N~0 c_~i~0)) is different from false [2023-01-27 21:03:16,168 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< 2 c_~N~0)) (.cse0 (<= c_~N~0 1)) (.cse2 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse27 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse27 .cse8))) (let ((.cse21 (+ .cse25 .cse26))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (select .cse23 .cse8))) (let ((.cse22 (+ .cse19 .cse20))) (or (< (+ .cse19 2147483648 .cse20) 0) (= .cse21 .cse22) (< (+ .cse19 2147483648) 0) (< 2147483647 .cse19) (< 2147483647 .cse22)))))) (< (+ .cse25 .cse26 2147483648) 0) (< (+ .cse25 2147483648) 0) (< 2147483647 .cse25) (< 2147483647 .cse21))))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse35 .cse8))) (let ((.cse32 (+ .cse28 .cse29))) (or (< (+ .cse28 .cse29 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse33 .cse8))) (or (< (+ .cse30 2147483648 .cse31) 0) (= .cse32 (+ .cse30 .cse31)) (< 2147483647 .cse30) (< 0 (+ .cse31 1)))))) (< (+ .cse28 2147483648) 0) (< 2147483647 .cse28) (< 2147483647 .cse32)))))))))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse1 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse10 .cse8)) (.cse3 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse3 .cse4 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select .cse7 .cse8))) (or (< (+ .cse5 2147483648 .cse6) 0) (= (+ .cse3 .cse4) (+ .cse5 .cse6)) (< 2147483647 .cse5) (< 0 (+ .cse6 1)))))) (< 0 (+ .cse4 1)) (< 2147483647 .cse3)))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse18 .cse8)) (.cse13 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (select .cse16 .cse8))) (let ((.cse15 (+ .cse11 .cse12))) (or (< (+ .cse11 2147483648 .cse12) 0) (= (+ .cse13 .cse14) .cse15) (< (+ .cse11 2147483648) 0) (< 2147483647 .cse11) (< 2147483647 .cse15)))))) (< (+ .cse13 .cse14 2147483648) 0) (< 0 (+ .cse14 1)) (< 2147483647 .cse13)))))))))) (or .cse1 .cse0 .cse2)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2023-01-27 21:03:16,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:03:16,435 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 386 treesize of output 206 [2023-01-27 21:03:16,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:03:16,450 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 584 treesize of output 488 [2023-01-27 21:03:16,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 248 [2023-01-27 21:03:16,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:03:16,482 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 184 treesize of output 146 [2023-01-27 21:03:16,547 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:03:16,547 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 337 treesize of output 1 [2023-01-27 21:03:16,556 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:03:16,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 1 [2023-01-27 21:03:16,570 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:03:16,570 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 294 treesize of output 1 [2023-01-27 21:03:16,582 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:03:16,582 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 386 treesize of output 1 [2023-01-27 21:03:16,588 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:03:16,588 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 337 treesize of output 1 [2023-01-27 21:03:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-01-27 21:03:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337374956] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:03:16,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:03:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2023-01-27 21:03:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596022442] [2023-01-27 21:03:16,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:03:16,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-27 21:03:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:03:16,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-27 21:03:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1143, Unknown=5, NotChecked=216, Total=1560 [2023-01-27 21:03:16,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-27 21:03:16,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1154 transitions, 25275 flow. Second operand has 40 states, 40 states have (on average 232.45) internal successors, (9298), 40 states have internal predecessors, (9298), 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) [2023-01-27 21:03:16,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:03:16,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-27 21:03:16,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:03:16,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 2 c_~N~0)) (.cse1 (<= c_~N~0 1)) (.cse3 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse3)) (or (let ((.cse10 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse29 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse28 (select .cse29 .cse10))) (let ((.cse23 (+ .cse27 .cse28))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse25 (select (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse25 .cse10))) (let ((.cse24 (+ .cse21 .cse22))) (or (< (+ .cse21 2147483648 .cse22) 0) (= .cse23 .cse24) (< (+ .cse21 2147483648) 0) (< 2147483647 .cse21) (< 2147483647 .cse24)))))) (< (+ .cse27 .cse28 2147483648) 0) (< (+ .cse27 2147483648) 0) (< 2147483647 .cse27) (< 2147483647 .cse23))))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse37 .cse10))) (let ((.cse34 (+ .cse30 .cse31))) (or (< (+ .cse30 .cse31 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (select .cse35 .cse10))) (or (< (+ .cse32 2147483648 .cse33) 0) (= .cse34 (+ .cse32 .cse33)) (< 2147483647 .cse32) (< 0 (+ .cse33 1)))))) (< (+ .cse30 2147483648) 0) (< 2147483647 .cse30) (< 2147483647 .cse34)))))))))) (and (or .cse1 (and (or .cse0 .cse4) (or .cse0 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse12 .cse10)) (.cse5 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse5 .cse6 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select .cse9 .cse10))) (or (< (+ .cse7 2147483648 .cse8) 0) (= (+ .cse5 .cse6) (+ .cse7 .cse8)) (< 2147483647 .cse7) (< 0 (+ .cse8 1)))))) (< 0 (+ .cse6 1)) (< 2147483647 .cse5)))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse20 .cse10)) (.cse15 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (select .cse18 .cse10))) (let ((.cse17 (+ .cse13 .cse14))) (or (< (+ .cse13 2147483648 .cse14) 0) (= (+ .cse15 .cse16) .cse17) (< (+ .cse13 2147483648) 0) (< 2147483647 .cse13) (< 2147483647 .cse17)))))) (< (+ .cse15 .cse16 2147483648) 0) (< 0 (+ .cse16 1)) (< 2147483647 .cse15)))))))))) (or .cse0 .cse1 .cse4)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse1 (< .cse3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2))) is different from false [2023-01-27 21:03:23,682 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_~j~0 4))) (let ((.cse11 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse12 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse5 (+ c_~A~0.offset .cse31)) (.cse4 (+ c_~A~0.offset .cse31 4)) (.cse6 (< (+ 2 c_~j~0) c_~N~0)) (.cse7 (<= c_~N~0 (+ c_~j~0 1))) (.cse17 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse16 (< (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648) 0)) (.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse18 (let ((.cse23 (+ c_~bag1~0 c_~sum1~0 .cse17))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse21 (select .cse24 .cse5)) (.cse22 (select .cse24 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse21)) (= (+ c_~bag2~0 .cse21 .cse22 c_~sum2~0) .cse23) (< (+ .cse21 .cse22 2147483648) 0) (< c_~bag2~0 (+ .cse22 1)))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse5)) (.cse26 (select .cse27 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse25)) (< (+ c_~bag2~0 .cse25 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse25 c_~sum2~0)) (= (+ c_~bag2~0 .cse25 .cse26 c_~sum2~0) .cse23) (< (+ .cse25 .cse26 2147483648) 0) (< (+ c_~bag2~0 .cse25 2147483648) 0) (< 2147483647 (+ .cse25 .cse26)))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse4)) (.cse28 (select .cse30 .cse5))) (or (< 2147483647 (+ c_~bag2~0 .cse28)) (= (+ c_~bag2~0 .cse28 .cse29 c_~sum2~0) .cse23) (< (+ c_~bag2~0 .cse28 .cse29 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse28 .cse29)) (< (+ c_~bag2~0 .cse28 2147483648) 0))))) .cse6 .cse7)))) (.cse19 (< (+ c_~i~0 1) c_~N~0)) (.cse20 (< 2147483647 |c_thread1Thread1of1ForFork0_#t~ret2#1|))) (and (or (< c_~i~0 c_~N~0) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse0)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< (+ .cse0 .cse1 2147483648) 0) (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) .cse2))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse8)) (< (+ .cse8 .cse9 2147483648) 0) (< c_~bag2~0 (+ .cse9 1)) (= (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse2))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 .cse14 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 .cse14)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse2))))) .cse6 .cse7))) (or .cse16 (< 2147483647 (+ c_~bag1~0 .cse17)) .cse18 (<= c_~cap1~0 |c_thread1Thread1of1ForFork0_#t~ret2#1|) .cse19 (< (+ c_~bag1~0 .cse17 2147483648) 0) .cse20) (or .cse16 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0) (< 2147483647 .cse2) .cse18 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19 .cse20))))) is different from false [2023-01-27 21:03:36,599 WARN L222 SmtUtils]: Spent 11.80s on a formula simplification. DAG size of input: 187 DAG size of output: 186 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:03:36,904 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse35 (* c_~j~0 4))) (let ((.cse11 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse12 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse5 (+ c_~A~0.offset .cse35)) (.cse4 (+ c_~A~0.offset .cse35 4)) (.cse6 (< (+ 2 c_~j~0) c_~N~0)) (.cse7 (<= c_~N~0 (+ c_~j~0 1))) (.cse17 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse21 (< 2 c_~N~0)) (.cse22 (<= c_~N~0 1)) (.cse24 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse23 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse16 (< (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648) 0)) (.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse18 (let ((.cse27 (+ c_~bag1~0 c_~sum1~0 .cse17))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse25 (select .cse28 .cse5)) (.cse26 (select .cse28 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse25)) (= (+ c_~bag2~0 .cse25 .cse26 c_~sum2~0) .cse27) (< (+ .cse25 .cse26 2147483648) 0) (< c_~bag2~0 (+ .cse26 1)))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse29 (select .cse31 .cse5)) (.cse30 (select .cse31 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse29)) (< (+ c_~bag2~0 .cse29 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse29 c_~sum2~0)) (= (+ c_~bag2~0 .cse29 .cse30 c_~sum2~0) .cse27) (< (+ .cse29 .cse30 2147483648) 0) (< (+ c_~bag2~0 .cse29 2147483648) 0) (< 2147483647 (+ .cse29 .cse30)))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse4)) (.cse32 (select .cse34 .cse5))) (or (< 2147483647 (+ c_~bag2~0 .cse32)) (= (+ c_~bag2~0 .cse32 .cse33 c_~sum2~0) .cse27) (< (+ c_~bag2~0 .cse32 .cse33 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse32 .cse33)) (< (+ c_~bag2~0 .cse32 2147483648) 0))))) .cse6 .cse7)))) (.cse19 (< (+ c_~i~0 1) c_~N~0)) (.cse20 (< 2147483647 |c_thread1Thread1of1ForFork0_#t~ret2#1|))) (and (or (< c_~i~0 c_~N~0) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse0)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< (+ .cse0 .cse1 2147483648) 0) (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) .cse2))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse8)) (< (+ .cse8 .cse9 2147483648) 0) (< c_~bag2~0 (+ .cse9 1)) (= (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse2))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 .cse14 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 .cse14)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse2))))) .cse6 .cse7))) (or .cse16 (< 2147483647 (+ c_~bag1~0 .cse17)) .cse18 (<= c_~cap1~0 |c_thread1Thread1of1ForFork0_#t~ret2#1|) .cse19 (< (+ c_~bag1~0 .cse17 2147483648) 0) .cse20) (or .cse21 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse22 .cse23 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse24)) (or .cse21 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse22 (< .cse24 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse23) (or .cse16 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0) (< 2147483647 .cse2) .cse18 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19 .cse20))))) is different from false [2023-01-27 21:03:50,224 WARN L222 SmtUtils]: Spent 9.62s on a formula simplification. DAG size of input: 175 DAG size of output: 174 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:03:53,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:03:59,850 WARN L222 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 190 DAG size of output: 189 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:04:18,516 INFO L130 PetriNetUnfolder]: 3279/5729 cut-off events. [2023-01-27 21:04:18,516 INFO L131 PetriNetUnfolder]: For 87306/87306 co-relation queries the response was YES. [2023-01-27 21:04:18,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61530 conditions, 5729 events. 3279/5729 cut-off events. For 87306/87306 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 38252 event pairs, 169 based on Foata normal form. 13/5742 useless extension candidates. Maximal degree in co-relation 61461. Up to 1656 conditions per place. [2023-01-27 21:04:18,564 INFO L137 encePairwiseOnDemand]: 748/759 looper letters, 605 selfloop transitions, 1288 changer transitions 30/1923 dead transitions. [2023-01-27 21:04:18,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 1923 transitions, 44381 flow [2023-01-27 21:04:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-01-27 21:04:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2023-01-27 21:04:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 16750 transitions. [2023-01-27 21:04:18,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3108241013936054 [2023-01-27 21:04:18,574 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 16750 transitions. [2023-01-27 21:04:18,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 16750 transitions. [2023-01-27 21:04:18,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:04:18,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 16750 transitions. [2023-01-27 21:04:18,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 235.91549295774647) internal successors, (16750), 71 states have internal predecessors, (16750), 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) [2023-01-27 21:04:18,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 759.0) internal successors, (54648), 72 states have internal predecessors, (54648), 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) [2023-01-27 21:04:18,611 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 759.0) internal successors, (54648), 72 states have internal predecessors, (54648), 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) [2023-01-27 21:04:18,612 INFO L175 Difference]: Start difference. First operand has 380 places, 1154 transitions, 25275 flow. Second operand 71 states and 16750 transitions. [2023-01-27 21:04:18,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 1923 transitions, 44381 flow [2023-01-27 21:04:19,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 1923 transitions, 42775 flow, removed 439 selfloop flow, removed 29 redundant places. [2023-01-27 21:04:19,655 INFO L231 Difference]: Finished difference. Result has 426 places, 1594 transitions, 37992 flow [2023-01-27 21:04:19,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=21505, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=735, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=37992, PETRI_PLACES=426, PETRI_TRANSITIONS=1594} [2023-01-27 21:04:19,656 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 406 predicate places. [2023-01-27 21:04:19,656 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 1594 transitions, 37992 flow [2023-01-27 21:04:19,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 232.45) internal successors, (9298), 40 states have internal predecessors, (9298), 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) [2023-01-27 21:04:19,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:04:19,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:04:19,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-01-27 21:04:19,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:04:19,862 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:04:19,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:04:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1028178930, now seen corresponding path program 18 times [2023-01-27 21:04:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:04:19,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295800559] [2023-01-27 21:04:19,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:04:19,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:04:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:04:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:04:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:04:24,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295800559] [2023-01-27 21:04:24,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295800559] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:04:24,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870982822] [2023-01-27 21:04:24,411 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 21:04:24,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:04:24,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:04:24,412 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) [2023-01-27 21:04:24,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-27 21:04:24,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 21:04:24,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:04:24,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 90 conjunts are in the unsatisfiable core [2023-01-27 21:04:24,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:04:24,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:04:24,848 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 [2023-01-27 21:04:25,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:25,714 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 234 treesize of output 154 [2023-01-27 21:04:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:04:25,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:04:34,329 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:34,329 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 1395 treesize of output 985 [2023-01-27 21:04:34,441 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:34,442 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 890 treesize of output 785 [2023-01-27 21:04:34,493 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:34,493 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 772 treesize of output 691 [2023-01-27 21:04:34,541 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:34,541 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 678 treesize of output 585 [2023-01-27 21:04:34,824 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 21:04:35,010 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,010 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 2217 treesize of output 1572 [2023-01-27 21:04:35,105 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,106 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 1528 treesize of output 1461 [2023-01-27 21:04:35,184 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,185 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 1448 treesize of output 1392 [2023-01-27 21:04:35,261 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,262 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 1379 treesize of output 1298 [2023-01-27 21:04:35,339 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,340 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 1285 treesize of output 1206 [2023-01-27 21:04:35,389 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 21:04:35,415 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,416 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 1193 treesize of output 1138 [2023-01-27 21:04:35,491 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 21:04:35,492 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 1125 treesize of output 1032 [2023-01-27 21:04:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:04:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870982822] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:04:36,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:04:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 35 [2023-01-27 21:04:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863719154] [2023-01-27 21:04:36,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:04:36,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 21:04:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:04:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 21:04:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1054, Unknown=1, NotChecked=0, Total=1260 [2023-01-27 21:04:36,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-27 21:04:36,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1594 transitions, 37992 flow. Second operand has 36 states, 36 states have (on average 232.58333333333334) internal successors, (8373), 36 states have internal predecessors, (8373), 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) [2023-01-27 21:04:36,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:04:36,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-27 21:04:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:05:03,854 INFO L130 PetriNetUnfolder]: 3121/5456 cut-off events. [2023-01-27 21:05:03,854 INFO L131 PetriNetUnfolder]: For 146857/146857 co-relation queries the response was YES. [2023-01-27 21:05:03,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66335 conditions, 5456 events. 3121/5456 cut-off events. For 146857/146857 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 36198 event pairs, 76 based on Foata normal form. 21/5477 useless extension candidates. Maximal degree in co-relation 66248. Up to 1557 conditions per place. [2023-01-27 21:05:03,908 INFO L137 encePairwiseOnDemand]: 748/759 looper letters, 316 selfloop transitions, 1284 changer transitions 27/1627 dead transitions. [2023-01-27 21:05:03,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1627 transitions, 41204 flow [2023-01-27 21:05:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-27 21:05:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-27 21:05:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 11330 transitions. [2023-01-27 21:05:03,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3109903381642512 [2023-01-27 21:05:03,915 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 11330 transitions. [2023-01-27 21:05:03,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 11330 transitions. [2023-01-27 21:05:03,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:05:03,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 11330 transitions. [2023-01-27 21:05:03,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 236.04166666666666) internal successors, (11330), 48 states have internal predecessors, (11330), 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) [2023-01-27 21:05:03,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 759.0) internal successors, (37191), 49 states have internal predecessors, (37191), 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) [2023-01-27 21:05:03,939 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 759.0) internal successors, (37191), 49 states have internal predecessors, (37191), 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) [2023-01-27 21:05:03,939 INFO L175 Difference]: Start difference. First operand has 426 places, 1594 transitions, 37992 flow. Second operand 48 states and 11330 transitions. [2023-01-27 21:05:03,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1627 transitions, 41204 flow [2023-01-27 21:05:05,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1627 transitions, 39660 flow, removed 413 selfloop flow, removed 18 redundant places. [2023-01-27 21:05:05,127 INFO L231 Difference]: Finished difference. Result has 443 places, 1510 transitions, 37688 flow [2023-01-27 21:05:05,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=34361, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=37688, PETRI_PLACES=443, PETRI_TRANSITIONS=1510} [2023-01-27 21:05:05,128 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 423 predicate places. [2023-01-27 21:05:05,129 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 1510 transitions, 37688 flow [2023-01-27 21:05:05,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 232.58333333333334) internal successors, (8373), 36 states have internal predecessors, (8373), 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) [2023-01-27 21:05:05,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:05:05,130 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:05:05,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-27 21:05:05,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:05:05,335 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:05:05,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:05:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1654616694, now seen corresponding path program 19 times [2023-01-27 21:05:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:05:05,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588332445] [2023-01-27 21:05:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:05:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:05:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:05:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:05:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:05:12,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588332445] [2023-01-27 21:05:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588332445] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:05:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468677121] [2023-01-27 21:05:12,108 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 21:05:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:05:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:05:12,109 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:05:12,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-27 21:05:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:05:12,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 92 conjunts are in the unsatisfiable core [2023-01-27 21:05:12,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:05:12,302 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 [2023-01-27 21:05:12,372 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 [2023-01-27 21:05:12,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:05:12,504 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 [2023-01-27 21:05:13,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:05:13,331 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 322 treesize of output 202 [2023-01-27 21:05:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:05:13,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:05:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:05:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468677121] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:05:31,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:05:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2023-01-27 21:05:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820827449] [2023-01-27 21:05:31,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:05:31,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-27 21:05:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:05:31,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-27 21:05:31,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1026, Unknown=10, NotChecked=0, Total=1190 [2023-01-27 21:05:31,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-27 21:05:31,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 1510 transitions, 37688 flow. Second operand has 35 states, 35 states have (on average 232.5142857142857) internal successors, (8138), 35 states have internal predecessors, (8138), 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) [2023-01-27 21:05:31,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:05:31,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-27 21:05:31,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:05:45,971 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") [2023-01-27 21:05:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 21:05:45,977 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 [2023-01-27 21:05:45,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-27 21:05:46,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-01-27 21:05:46,173 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:620) 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:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) 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:483) 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.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:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) 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) ... 64 more [2023-01-27 21:05:46,177 INFO L158 Benchmark]: Toolchain (without parser) took 704764.60ms. Allocated memory was 482.3MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 448.8MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 274.7MB. Max. memory is 16.0GB. [2023-01-27 21:05:46,177 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory is still 302.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:05:46,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.00ms. Allocated memory is still 482.3MB. Free memory was 448.1MB in the beginning and 436.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 21:05:46,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.38ms. Allocated memory is still 482.3MB. Free memory was 436.2MB in the beginning and 434.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:05:46,177 INFO L158 Benchmark]: Boogie Preprocessor took 21.21ms. Allocated memory is still 482.3MB. Free memory was 434.1MB in the beginning and 432.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:05:46,177 INFO L158 Benchmark]: RCFGBuilder took 459.50ms. Allocated memory is still 482.3MB. Free memory was 432.0MB in the beginning and 406.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 21:05:46,177 INFO L158 Benchmark]: TraceAbstraction took 704088.83ms. Allocated memory was 482.3MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 405.5MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 232.7MB. Max. memory is 16.0GB. [2023-01-27 21:05:46,178 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory is still 302.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 161.00ms. Allocated memory is still 482.3MB. Free memory was 448.1MB in the beginning and 436.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.38ms. Allocated memory is still 482.3MB. Free memory was 436.2MB in the beginning and 434.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.21ms. Allocated memory is still 482.3MB. Free memory was 434.1MB in the beginning and 432.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 459.50ms. Allocated memory is still 482.3MB. Free memory was 432.0MB in the beginning and 406.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 704088.83ms. Allocated memory was 482.3MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 405.5MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 232.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 315 PlacesBefore, 20 PlacesAfterwards, 336 TransitionsBefore, 17 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 8 FixpointIterations, 100 TrivialSequentialCompositions, 198 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 75 ConcurrentYvCompositions, 24 ChoiceCompositions, 413 TotalNumberOfCompositions, 22140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21832, independent: 21808, independent conditional: 0, independent unconditional: 21808, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15314, independent: 15300, independent conditional: 0, independent unconditional: 15300, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21832, independent: 6508, independent conditional: 0, independent unconditional: 6508, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 15314, unknown conditional: 0, unknown unconditional: 15314] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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...