./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 23:00:40,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 23:00:40,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 23:00:40,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 23:00:40,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 23:00:40,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 23:00:40,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 23:00:40,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 23:00:40,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 23:00:40,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 23:00:40,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 23:00:40,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 23:00:40,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 23:00:40,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 23:00:40,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 23:00:40,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 23:00:40,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 23:00:40,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 23:00:40,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 23:00:40,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 23:00:40,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 23:00:40,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 23:00:40,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 23:00:40,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 23:00:41,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 23:00:41,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 23:00:41,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 23:00:41,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 23:00:41,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 23:00:41,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 23:00:41,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 23:00:41,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 23:00:41,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 23:00:41,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 23:00:41,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 23:00:41,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 23:00:41,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 23:00:41,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 23:00:41,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 23:00:41,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 23:00:41,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 23:00:41,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 23:00:41,040 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 23:00:41,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 23:00:41,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 23:00:41,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 23:00:41,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 23:00:41,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 23:00:41,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 23:00:41,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 23:00:41,043 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 23:00:41,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 23:00:41,044 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 23:00:41,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 23:00:41,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 23:00:41,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 23:00:41,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 23:00:41,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 23:00:41,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 23:00:41,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 23:00:41,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:00:41,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 23:00:41,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 23:00:41,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 23:00:41,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 23:00:41,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 23:00:41,047 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 23:00:41,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 23:00:41,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 23:00:41,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 23:00:41,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a [2021-12-17 23:00:41,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 23:00:41,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 23:00:41,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 23:00:41,327 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 23:00:41,328 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 23:00:41,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2021-12-17 23:00:41,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f31156ce/15cb2b875be344728406364de31afa42/FLAG57564de3c [2021-12-17 23:00:41,741 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 23:00:41,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2021-12-17 23:00:41,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f31156ce/15cb2b875be344728406364de31afa42/FLAG57564de3c [2021-12-17 23:00:42,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f31156ce/15cb2b875be344728406364de31afa42 [2021-12-17 23:00:42,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 23:00:42,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 23:00:42,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 23:00:42,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 23:00:42,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 23:00:42,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce32662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42, skipping insertion in model container [2021-12-17 23:00:42,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 23:00:42,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 23:00:42,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2021-12-17 23:00:42,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:00:42,398 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 23:00:42,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2021-12-17 23:00:42,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:00:42,446 INFO L208 MainTranslator]: Completed translation [2021-12-17 23:00:42,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42 WrapperNode [2021-12-17 23:00:42,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 23:00:42,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 23:00:42,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 23:00:42,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 23:00:42,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,493 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2021-12-17 23:00:42,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 23:00:42,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 23:00:42,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 23:00:42,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 23:00:42,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 23:00:42,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 23:00:42,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 23:00:42,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 23:00:42,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (1/1) ... [2021-12-17 23:00:42,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:00:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:00:42,597 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) [2021-12-17 23:00:42,605 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 [2021-12-17 23:00:42,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 23:00:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 23:00:42,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 23:00:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 23:00:42,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 23:00:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 23:00:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 23:00:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 23:00:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 23:00:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 23:00:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 23:00:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 23:00:42,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 23:00:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 23:00:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 23:00:42,628 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 23:00:42,685 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 23:00:42,686 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 23:00:42,935 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 23:00:42,993 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 23:00:42,993 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 23:00:42,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:00:42 BoogieIcfgContainer [2021-12-17 23:00:42,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 23:00:42,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 23:00:42,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 23:00:43,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 23:00:43,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:00:42" (1/3) ... [2021-12-17 23:00:43,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100dfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:00:43, skipping insertion in model container [2021-12-17 23:00:43,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:00:42" (2/3) ... [2021-12-17 23:00:43,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100dfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:00:43, skipping insertion in model container [2021-12-17 23:00:43,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:00:42" (3/3) ... [2021-12-17 23:00:43,007 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2021-12-17 23:00:43,010 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 23:00:43,011 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 23:00:43,011 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 23:00:43,011 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 23:00:43,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,084 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,084 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,084 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,084 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,084 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,090 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,090 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:00:43,096 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-12-17 23:00:43,137 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 23:00:43,143 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 23:00:43,143 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-17 23:00:43,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 189 transitions, 394 flow [2021-12-17 23:00:43,208 INFO L129 PetriNetUnfolder]: 15/187 cut-off events. [2021-12-17 23:00:43,208 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-17 23:00:43,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 15/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2021-12-17 23:00:43,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 189 transitions, 394 flow [2021-12-17 23:00:43,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 178 transitions, 368 flow [2021-12-17 23:00:43,238 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2021-12-17 23:00:43,238 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-17 23:00:43,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:43,239 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:43,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1982625687, now seen corresponding path program 1 times [2021-12-17 23:00:43,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:43,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033308003] [2021-12-17 23:00:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:43,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:43,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033308003] [2021-12-17 23:00:43,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033308003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:00:43,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:00:43,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 23:00:43,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715703297] [2021-12-17 23:00:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:00:43,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 23:00:43,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:43,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 23:00:43,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 23:00:43,511 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2021-12-17 23:00:43,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 178 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 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) [2021-12-17 23:00:43,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:43,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2021-12-17 23:00:43,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:43,587 INFO L129 PetriNetUnfolder]: 14/193 cut-off events. [2021-12-17 23:00:43,587 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-12-17 23:00:43,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 193 events. 14/193 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 168 event pairs, 3 based on Foata normal form. 15/195 useless extension candidates. Maximal degree in co-relation 147. Up to 20 conditions per place. [2021-12-17 23:00:43,589 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 7 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2021-12-17 23:00:43,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 362 flow [2021-12-17 23:00:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 23:00:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 23:00:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2021-12-17 23:00:43,603 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9497354497354498 [2021-12-17 23:00:43,604 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2021-12-17 23:00:43,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2021-12-17 23:00:43,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:43,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2021-12-17 23:00:43,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 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) [2021-12-17 23:00:43,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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) [2021-12-17 23:00:43,619 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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) [2021-12-17 23:00:43,621 INFO L186 Difference]: Start difference. First operand has 170 places, 178 transitions, 368 flow. Second operand 2 states and 359 transitions. [2021-12-17 23:00:43,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 362 flow [2021-12-17 23:00:43,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 168 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 23:00:43,629 INFO L242 Difference]: Finished difference. Result has 167 places, 162 transitions, 328 flow [2021-12-17 23:00:43,630 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=328, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2021-12-17 23:00:43,634 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2021-12-17 23:00:43,634 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 328 flow [2021-12-17 23:00:43,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 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) [2021-12-17 23:00:43,634 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:43,635 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:43,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 23:00:43,636 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -955987473, now seen corresponding path program 1 times [2021-12-17 23:00:43,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:43,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044999424] [2021-12-17 23:00:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:43,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:43,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:43,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044999424] [2021-12-17 23:00:43,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044999424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:00:43,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:00:43,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 23:00:43,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121326442] [2021-12-17 23:00:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:00:43,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 23:00:43,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 23:00:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:00:43,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2021-12-17 23:00:43,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 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) [2021-12-17 23:00:43,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:43,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2021-12-17 23:00:43,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:43,967 INFO L129 PetriNetUnfolder]: 22/216 cut-off events. [2021-12-17 23:00:43,967 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-12-17 23:00:43,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 216 events. 22/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 296 event pairs, 3 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 283. Up to 38 conditions per place. [2021-12-17 23:00:43,970 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 37 selfloop transitions, 2 changer transitions 4/171 dead transitions. [2021-12-17 23:00:43,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 171 transitions, 434 flow [2021-12-17 23:00:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:00:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-17 23:00:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2021-12-17 23:00:43,975 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7767195767195767 [2021-12-17 23:00:43,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2021-12-17 23:00:43,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2021-12-17 23:00:43,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:43,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2021-12-17 23:00:43,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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) [2021-12-17 23:00:43,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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) [2021-12-17 23:00:43,981 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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) [2021-12-17 23:00:43,981 INFO L186 Difference]: Start difference. First operand has 167 places, 162 transitions, 328 flow. Second operand 5 states and 734 transitions. [2021-12-17 23:00:43,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 171 transitions, 434 flow [2021-12-17 23:00:43,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 171 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:00:43,987 INFO L242 Difference]: Finished difference. Result has 168 places, 163 transitions, 344 flow [2021-12-17 23:00:43,987 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2021-12-17 23:00:43,988 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2021-12-17 23:00:43,988 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 344 flow [2021-12-17 23:00:43,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 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) [2021-12-17 23:00:43,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:43,989 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:43,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 23:00:43,990 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:43,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:43,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1493556367, now seen corresponding path program 1 times [2021-12-17 23:00:43,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:43,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104081391] [2021-12-17 23:00:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:43,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:44,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:44,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104081391] [2021-12-17 23:00:44,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104081391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:00:44,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:00:44,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 23:00:44,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857868484] [2021-12-17 23:00:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:00:44,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 23:00:44,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 23:00:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:00:44,186 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2021-12-17 23:00:44,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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) [2021-12-17 23:00:44,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:44,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2021-12-17 23:00:44,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:44,307 INFO L129 PetriNetUnfolder]: 103/466 cut-off events. [2021-12-17 23:00:44,308 INFO L130 PetriNetUnfolder]: For 21/25 co-relation queries the response was YES. [2021-12-17 23:00:44,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 466 events. 103/466 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1727 event pairs, 21 based on Foata normal form. 8/419 useless extension candidates. Maximal degree in co-relation 700. Up to 81 conditions per place. [2021-12-17 23:00:44,312 INFO L132 encePairwiseOnDemand]: 181/189 looper letters, 34 selfloop transitions, 9 changer transitions 10/192 dead transitions. [2021-12-17 23:00:44,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 192 transitions, 516 flow [2021-12-17 23:00:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:00:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 23:00:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 980 transitions. [2021-12-17 23:00:44,318 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2021-12-17 23:00:44,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 980 transitions. [2021-12-17 23:00:44,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 980 transitions. [2021-12-17 23:00:44,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:44,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 980 transitions. [2021-12-17 23:00:44,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 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) [2021-12-17 23:00:44,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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) [2021-12-17 23:00:44,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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) [2021-12-17 23:00:44,323 INFO L186 Difference]: Start difference. First operand has 168 places, 163 transitions, 344 flow. Second operand 6 states and 980 transitions. [2021-12-17 23:00:44,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 192 transitions, 516 flow [2021-12-17 23:00:44,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 192 transitions, 510 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-17 23:00:44,343 INFO L242 Difference]: Finished difference. Result has 171 places, 170 transitions, 396 flow [2021-12-17 23:00:44,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=171, PETRI_TRANSITIONS=170} [2021-12-17 23:00:44,344 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 1 predicate places. [2021-12-17 23:00:44,345 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 170 transitions, 396 flow [2021-12-17 23:00:44,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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) [2021-12-17 23:00:44,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:44,345 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:44,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 23:00:44,346 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1590314738, now seen corresponding path program 1 times [2021-12-17 23:00:44,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:44,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136721294] [2021-12-17 23:00:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:44,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:44,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:44,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136721294] [2021-12-17 23:00:44,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136721294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:00:44,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:00:44,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 23:00:44,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118482988] [2021-12-17 23:00:44,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:00:44,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:00:44,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:44,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:00:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:00:44,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 189 [2021-12-17 23:00:44,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 170 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 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) [2021-12-17 23:00:44,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:44,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 189 [2021-12-17 23:00:44,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:44,495 INFO L129 PetriNetUnfolder]: 31/373 cut-off events. [2021-12-17 23:00:44,495 INFO L130 PetriNetUnfolder]: For 74/88 co-relation queries the response was YES. [2021-12-17 23:00:44,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 373 events. 31/373 cut-off events. For 74/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 961 event pairs, 8 based on Foata normal form. 6/367 useless extension candidates. Maximal degree in co-relation 560. Up to 47 conditions per place. [2021-12-17 23:00:44,497 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 31 selfloop transitions, 8 changer transitions 18/192 dead transitions. [2021-12-17 23:00:44,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 192 transitions, 562 flow [2021-12-17 23:00:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:00:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 23:00:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1361 transitions. [2021-12-17 23:00:44,500 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8001175778953556 [2021-12-17 23:00:44,500 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1361 transitions. [2021-12-17 23:00:44,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1361 transitions. [2021-12-17 23:00:44,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:44,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1361 transitions. [2021-12-17 23:00:44,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.22222222222223) internal successors, (1361), 9 states have internal predecessors, (1361), 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) [2021-12-17 23:00:44,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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) [2021-12-17 23:00:44,506 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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) [2021-12-17 23:00:44,506 INFO L186 Difference]: Start difference. First operand has 171 places, 170 transitions, 396 flow. Second operand 9 states and 1361 transitions. [2021-12-17 23:00:44,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 192 transitions, 562 flow [2021-12-17 23:00:44,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 192 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:00:44,510 INFO L242 Difference]: Finished difference. Result has 181 places, 171 transitions, 424 flow [2021-12-17 23:00:44,510 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=181, PETRI_TRANSITIONS=171} [2021-12-17 23:00:44,511 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 11 predicate places. [2021-12-17 23:00:44,511 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 171 transitions, 424 flow [2021-12-17 23:00:44,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 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) [2021-12-17 23:00:44,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:44,512 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:44,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 23:00:44,512 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -496358003, now seen corresponding path program 1 times [2021-12-17 23:00:44,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:44,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897180427] [2021-12-17 23:00:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:44,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 23:00:44,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:44,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897180427] [2021-12-17 23:00:44,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897180427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:00:44,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:00:44,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:00:44,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269630152] [2021-12-17 23:00:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:00:44,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:00:44,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:00:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:00:44,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 189 [2021-12-17 23:00:44,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 171 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 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) [2021-12-17 23:00:44,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:44,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 189 [2021-12-17 23:00:44,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:44,756 INFO L129 PetriNetUnfolder]: 93/578 cut-off events. [2021-12-17 23:00:44,756 INFO L130 PetriNetUnfolder]: For 196/200 co-relation queries the response was YES. [2021-12-17 23:00:44,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 578 events. 93/578 cut-off events. For 196/200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2599 event pairs, 19 based on Foata normal form. 4/555 useless extension candidates. Maximal degree in co-relation 1052. Up to 137 conditions per place. [2021-12-17 23:00:44,759 INFO L132 encePairwiseOnDemand]: 178/189 looper letters, 56 selfloop transitions, 9 changer transitions 13/201 dead transitions. [2021-12-17 23:00:44,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 691 flow [2021-12-17 23:00:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:00:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 23:00:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1301 transitions. [2021-12-17 23:00:44,762 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7648442092886537 [2021-12-17 23:00:44,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1301 transitions. [2021-12-17 23:00:44,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1301 transitions. [2021-12-17 23:00:44,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:44,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1301 transitions. [2021-12-17 23:00:44,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.55555555555554) internal successors, (1301), 9 states have internal predecessors, (1301), 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) [2021-12-17 23:00:44,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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) [2021-12-17 23:00:44,768 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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) [2021-12-17 23:00:44,768 INFO L186 Difference]: Start difference. First operand has 181 places, 171 transitions, 424 flow. Second operand 9 states and 1301 transitions. [2021-12-17 23:00:44,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 691 flow [2021-12-17 23:00:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 201 transitions, 671 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-12-17 23:00:44,772 INFO L242 Difference]: Finished difference. Result has 184 places, 174 transitions, 459 flow [2021-12-17 23:00:44,773 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=184, PETRI_TRANSITIONS=174} [2021-12-17 23:00:44,773 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places. [2021-12-17 23:00:44,773 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 174 transitions, 459 flow [2021-12-17 23:00:44,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 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) [2021-12-17 23:00:44,774 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:44,774 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:44,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 23:00:44,775 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1666740558, now seen corresponding path program 1 times [2021-12-17 23:00:44,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:44,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527439147] [2021-12-17 23:00:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:44,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 23:00:44,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:44,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527439147] [2021-12-17 23:00:44,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527439147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:00:44,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:00:44,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:00:44,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792078895] [2021-12-17 23:00:44,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:00:44,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:00:44,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:00:44,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:00:44,830 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2021-12-17 23:00:44,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 174 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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) [2021-12-17 23:00:44,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:44,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2021-12-17 23:00:44,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:44,951 INFO L129 PetriNetUnfolder]: 198/745 cut-off events. [2021-12-17 23:00:44,952 INFO L130 PetriNetUnfolder]: For 392/396 co-relation queries the response was YES. [2021-12-17 23:00:44,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 745 events. 198/745 cut-off events. For 392/396 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3714 event pairs, 41 based on Foata normal form. 25/741 useless extension candidates. Maximal degree in co-relation 1605. Up to 127 conditions per place. [2021-12-17 23:00:44,957 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 36 selfloop transitions, 17 changer transitions 0/198 dead transitions. [2021-12-17 23:00:44,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 198 transitions, 674 flow [2021-12-17 23:00:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:00:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-17 23:00:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2021-12-17 23:00:44,959 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8793650793650793 [2021-12-17 23:00:44,959 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 831 transitions. [2021-12-17 23:00:44,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 831 transitions. [2021-12-17 23:00:44,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:44,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 831 transitions. [2021-12-17 23:00:44,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.2) internal successors, (831), 5 states have internal predecessors, (831), 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) [2021-12-17 23:00:44,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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) [2021-12-17 23:00:44,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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) [2021-12-17 23:00:44,963 INFO L186 Difference]: Start difference. First operand has 184 places, 174 transitions, 459 flow. Second operand 5 states and 831 transitions. [2021-12-17 23:00:44,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 198 transitions, 674 flow [2021-12-17 23:00:44,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 198 transitions, 653 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-12-17 23:00:44,967 INFO L242 Difference]: Finished difference. Result has 184 places, 183 transitions, 557 flow [2021-12-17 23:00:44,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2021-12-17 23:00:44,968 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places. [2021-12-17 23:00:44,968 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 557 flow [2021-12-17 23:00:44,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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) [2021-12-17 23:00:44,969 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:44,969 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:44,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 23:00:44,969 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1403839526, now seen corresponding path program 2 times [2021-12-17 23:00:44,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:44,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528081016] [2021-12-17 23:00:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:44,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:46,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528081016] [2021-12-17 23:00:46,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528081016] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:00:46,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119268642] [2021-12-17 23:00:46,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:00:46,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:00:46,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:00:46,429 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) [2021-12-17 23:00:46,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 23:00:46,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:00:46,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:00:46,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-17 23:00:46,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:00:48,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-17 23:00:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:00:48,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:00:48,846 INFO L354 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2021-12-17 23:00:48,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2021-12-17 23:00:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:00:50,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119268642] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:00:50,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:00:50,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 18] total 60 [2021-12-17 23:00:50,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842038015] [2021-12-17 23:00:50,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:00:50,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-17 23:00:50,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:50,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-17 23:00:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=2987, Unknown=0, NotChecked=0, Total=3540 [2021-12-17 23:00:50,075 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 189 [2021-12-17 23:00:50,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 557 flow. Second operand has 60 states, 60 states have (on average 69.58333333333333) internal successors, (4175), 60 states have internal predecessors, (4175), 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) [2021-12-17 23:00:50,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:50,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 189 [2021-12-17 23:00:50,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:00:55,840 INFO L129 PetriNetUnfolder]: 3535/7271 cut-off events. [2021-12-17 23:00:55,840 INFO L130 PetriNetUnfolder]: For 7075/7075 co-relation queries the response was YES. [2021-12-17 23:00:55,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19619 conditions, 7271 events. 3535/7271 cut-off events. For 7075/7075 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 59671 event pairs, 449 based on Foata normal form. 2/6968 useless extension candidates. Maximal degree in co-relation 19604. Up to 1713 conditions per place. [2021-12-17 23:00:55,878 INFO L132 encePairwiseOnDemand]: 137/189 looper letters, 374 selfloop transitions, 178 changer transitions 156/763 dead transitions. [2021-12-17 23:00:55,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 763 transitions, 4333 flow [2021-12-17 23:00:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-17 23:00:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-12-17 23:00:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 6883 transitions. [2021-12-17 23:00:55,892 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3793540564373898 [2021-12-17 23:00:55,892 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 6883 transitions. [2021-12-17 23:00:55,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 6883 transitions. [2021-12-17 23:00:55,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:00:55,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 6883 transitions. [2021-12-17 23:00:55,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 71.69791666666667) internal successors, (6883), 96 states have internal predecessors, (6883), 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) [2021-12-17 23:00:55,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 189.0) internal successors, (18333), 97 states have internal predecessors, (18333), 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) [2021-12-17 23:00:55,931 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 189.0) internal successors, (18333), 97 states have internal predecessors, (18333), 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) [2021-12-17 23:00:55,931 INFO L186 Difference]: Start difference. First operand has 184 places, 183 transitions, 557 flow. Second operand 96 states and 6883 transitions. [2021-12-17 23:00:55,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 763 transitions, 4333 flow [2021-12-17 23:00:55,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 763 transitions, 4333 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:00:55,967 INFO L242 Difference]: Finished difference. Result has 332 places, 358 transitions, 2135 flow [2021-12-17 23:00:55,968 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=2135, PETRI_PLACES=332, PETRI_TRANSITIONS=358} [2021-12-17 23:00:55,968 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 162 predicate places. [2021-12-17 23:00:55,968 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 358 transitions, 2135 flow [2021-12-17 23:00:55,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 69.58333333333333) internal successors, (4175), 60 states have internal predecessors, (4175), 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) [2021-12-17 23:00:55,970 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:00:55,970 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:00:55,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 23:00:56,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:00:56,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:00:56,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:00:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash 735380230, now seen corresponding path program 3 times [2021-12-17 23:00:56,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:00:56,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476486358] [2021-12-17 23:00:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:00:56,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:00:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:00:57,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476486358] [2021-12-17 23:00:57,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476486358] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:00:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60527386] [2021-12-17 23:00:57,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 23:00:57,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:00:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:00:57,043 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) [2021-12-17 23:00:57,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 23:00:57,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 23:00:57,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:00:57,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 23:00:57,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:00:57,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:00:57,256 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 23:00:57,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 23:00:57,696 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-17 23:00:57,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-17 23:00:57,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 23:00:58,613 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-17 23:00:58,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-12-17 23:00:58,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:00:59,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2021-12-17 23:00:59,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:00:59,600 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-12-17 23:00:59,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2021-12-17 23:00:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:59,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:01:03,984 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:03,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 95 [2021-12-17 23:01:04,017 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:04,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13300 treesize of output 12330 [2021-12-17 23:01:04,071 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:04,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12276 treesize of output 11556 [2021-12-17 23:01:04,145 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:04,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11508 treesize of output 8484 [2021-12-17 23:01:04,217 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:04,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8436 treesize of output 6948 [2021-12-17 23:01:04,253 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 23:01:04,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:01:04,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2021-12-17 23:01:04,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533024742] [2021-12-17 23:01:04,254 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 23:01:04,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 23:01:04,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:01:04,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 23:01:04,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=3789, Unknown=56, NotChecked=0, Total=4556 [2021-12-17 23:01:04,257 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 189 [2021-12-17 23:01:04,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 358 transitions, 2135 flow. Second operand has 26 states, 26 states have (on average 72.88461538461539) internal successors, (1895), 26 states have internal predecessors, (1895), 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) [2021-12-17 23:01:04,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:01:04,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 189 [2021-12-17 23:01:04,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:01:06,266 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([538] L49-5-->L59: Formula: (= v_~i~0_15 (+ v_~i~0_16 1)) InVars {~i~0=v_~i~0_16} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][393], [Black: 251#(< ~i~0 ~N~0), Black: 254#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 189#(= ~ok~0 1), 56#L103-1true, 260#true, Black: 1295#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1345#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0)) (or (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0) (forall ((~queue~0.base Int)) (or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~end~0 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))))), Black: 1362#(and (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 284#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1390#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1289#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1309#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 1376#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (and (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (or (<= (+ (* 4 ~start~0) ~queue~0.offset) 0) (<= (+ ~n~0 ~start~0) (+ ~end~0 1))))) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= ~last~0 ~v_old~0)), Black: 1347#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1400#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= ~last~0 ~v_old~0)), 9#L59true, Black: 864#(or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256))), Black: 1313#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 860#(and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1392#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~last~0 ~v_old~0)), 1506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1353#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1378#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0)) (or (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0) (forall ((~queue~0.base Int)) (or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~end~0 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))))), Black: 1305#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 1307#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1335#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1301#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1327#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0)), Black: 1297#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1358#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1422#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0))), Black: 1311#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 4294967294)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1287#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 700#(and (= ~queue~0.offset 0) (= ~ok~0 1) (< ~i~0 ~N~0) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1428#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1291#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1426#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1374#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= ~last~0 ~v_old~0)), Black: 1349#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0)), Black: 1406#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))))), Black: 1315#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 1293#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1396#(and (= ~ok~0 1) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), 184#true, Black: 1430#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1339#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1416#(and (not (= 0 (mod ~ok~0 256))) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))))), Black: 1331#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0))), Black: 1317#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 1329#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1165#(or (<= 1 ~end~0) (< ~end~0 0) (and (= (* 4 ~start~0) (* 4 ~end~0)) (not (= 0 (mod ~ok~0 256))))), Black: 1418#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0))), Black: 1364#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1341#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)), Black: 1424#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1283#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 707#(and (= ~queue~0.offset 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 1370#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0))), Black: 856#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256)))), Black: 1382#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 208#(and (<= ~end~0 ~start~0) (or (= 0 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0))), Black: 206#(and (< ~i~0 ~N~0) (<= ~end~0 ~start~0)), Black: 202#(<= ~end~0 ~start~0), Black: 222#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 122#L70true, 252#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 200#true, Black: 240#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 238#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-17 23:01:06,267 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2021-12-17 23:01:06,268 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-17 23:01:06,268 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-17 23:01:06,268 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-17 23:01:07,022 INFO L129 PetriNetUnfolder]: 3991/8008 cut-off events. [2021-12-17 23:01:07,023 INFO L130 PetriNetUnfolder]: For 82683/83373 co-relation queries the response was YES. [2021-12-17 23:01:07,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44430 conditions, 8008 events. 3991/8008 cut-off events. For 82683/83373 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 66271 event pairs, 863 based on Foata normal form. 68/7772 useless extension candidates. Maximal degree in co-relation 44361. Up to 2040 conditions per place. [2021-12-17 23:01:07,172 INFO L132 encePairwiseOnDemand]: 153/189 looper letters, 373 selfloop transitions, 84 changer transitions 15/538 dead transitions. [2021-12-17 23:01:07,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 538 transitions, 4514 flow [2021-12-17 23:01:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-17 23:01:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-12-17 23:01:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2603 transitions. [2021-12-17 23:01:07,176 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.405073140367258 [2021-12-17 23:01:07,176 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2603 transitions. [2021-12-17 23:01:07,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2603 transitions. [2021-12-17 23:01:07,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:01:07,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2603 transitions. [2021-12-17 23:01:07,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 76.55882352941177) internal successors, (2603), 34 states have internal predecessors, (2603), 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) [2021-12-17 23:01:07,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 189.0) internal successors, (6615), 35 states have internal predecessors, (6615), 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) [2021-12-17 23:01:07,197 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 189.0) internal successors, (6615), 35 states have internal predecessors, (6615), 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) [2021-12-17 23:01:07,197 INFO L186 Difference]: Start difference. First operand has 332 places, 358 transitions, 2135 flow. Second operand 34 states and 2603 transitions. [2021-12-17 23:01:07,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 538 transitions, 4514 flow [2021-12-17 23:01:07,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 538 transitions, 4226 flow, removed 137 selfloop flow, removed 22 redundant places. [2021-12-17 23:01:07,403 INFO L242 Difference]: Finished difference. Result has 326 places, 379 transitions, 2419 flow [2021-12-17 23:01:07,404 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2419, PETRI_PLACES=326, PETRI_TRANSITIONS=379} [2021-12-17 23:01:07,406 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 156 predicate places. [2021-12-17 23:01:07,406 INFO L470 AbstractCegarLoop]: Abstraction has has 326 places, 379 transitions, 2419 flow [2021-12-17 23:01:07,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 72.88461538461539) internal successors, (1895), 26 states have internal predecessors, (1895), 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) [2021-12-17 23:01:07,407 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:01:07,407 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:01:07,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 23:01:07,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-17 23:01:07,629 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:01:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:01:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1715049940, now seen corresponding path program 4 times [2021-12-17 23:01:07,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:01:07,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122404668] [2021-12-17 23:01:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:01:07,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:01:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:01:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:08,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:01:08,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122404668] [2021-12-17 23:01:08,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122404668] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:01:08,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958240126] [2021-12-17 23:01:08,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 23:01:08,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:08,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:01:08,381 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) [2021-12-17 23:01:08,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 23:01:08,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 23:01:08,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:01:08,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-17 23:01:08,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:01:08,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:01:09,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 23:01:09,567 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 23:01:09,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-17 23:01:09,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:01:09,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:01:10,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:01:10,401 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-17 23:01:10,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2021-12-17 23:01:10,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-17 23:01:10,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-12-17 23:01:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:01:10,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:01:10,892 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod c_~ok~0 256))) (forall ((v_ArrVal_188 (Array Int Int))) (<= c_~v_old~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_188) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset))))) is different from false [2021-12-17 23:01:16,681 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:16,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 86 [2021-12-17 23:01:16,710 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:16,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14912 treesize of output 13217 [2021-12-17 23:01:16,761 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:16,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13217 treesize of output 10577 [2021-12-17 23:01:16,832 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:16,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10577 treesize of output 9281 [2021-12-17 23:01:16,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8189 treesize of output 6653 [2021-12-17 23:01:16,996 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 23:01:16,996 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:01:16,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-17 23:01:16,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373564385] [2021-12-17 23:01:16,997 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 23:01:16,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-17 23:01:16,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:01:16,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-17 23:01:17,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=4608, Unknown=33, NotChecked=140, Total=5256 [2021-12-17 23:01:17,001 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 189 [2021-12-17 23:01:17,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 379 transitions, 2419 flow. Second operand has 25 states, 25 states have (on average 68.16) internal successors, (1704), 25 states have internal predecessors, (1704), 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) [2021-12-17 23:01:17,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:01:17,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 189 [2021-12-17 23:01:17,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:01:19,763 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([538] L49-5-->L59: Formula: (= v_~i~0_15 (+ v_~i~0_16 1)) InVars {~i~0=v_~i~0_16} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][395], [Black: 251#(< ~i~0 ~N~0), Black: 254#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 189#(= ~ok~0 1), 56#L103-1true, 260#true, Black: 1295#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1345#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0)) (or (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0) (forall ((~queue~0.base Int)) (or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~end~0 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))))), Black: 284#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1289#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1309#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 1376#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (and (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (or (<= (+ (* 4 ~start~0) ~queue~0.offset) 0) (<= (+ ~n~0 ~start~0) (+ ~end~0 1))))) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= ~last~0 ~v_old~0)), Black: 1347#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1400#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= ~last~0 ~v_old~0)), 9#L59true, Black: 864#(or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256))), Black: 1313#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 860#(and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1392#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~last~0 ~v_old~0)), 1506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1353#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1305#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 1307#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1335#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1301#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1327#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0)), Black: 1297#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1422#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0))), Black: 1311#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 4294967294)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1287#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 700#(and (= ~queue~0.offset 0) (= ~ok~0 1) (< ~i~0 ~N~0) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1291#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1406#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))))), Black: 1315#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 1293#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 184#true, Black: 1339#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1331#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0))), Black: 1317#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 1329#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1165#(or (<= 1 ~end~0) (< ~end~0 0) (and (= (* 4 ~start~0) (* 4 ~end~0)) (not (= 0 (mod ~ok~0 256))))), Black: 1364#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1341#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)), Black: 1283#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 707#(and (= ~queue~0.offset 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 856#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256)))), Black: 208#(and (<= ~end~0 ~start~0) (or (= 0 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0))), Black: 206#(and (< ~i~0 ~N~0) (<= ~end~0 ~start~0)), Black: 202#(<= ~end~0 ~start~0), Black: 2349#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= (+ ~n~0 ~start~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~end~0)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= (+ ~n~0 ~start~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~end~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1507#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 2387#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2385#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1487#(= ~ok~0 1), 3292#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 222#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 122#L70true, 252#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 200#true, Black: 240#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 238#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-17 23:01:19,764 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2021-12-17 23:01:19,764 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-17 23:01:19,764 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-17 23:01:19,764 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-17 23:01:20,511 INFO L129 PetriNetUnfolder]: 4732/9367 cut-off events. [2021-12-17 23:01:20,511 INFO L130 PetriNetUnfolder]: For 85509/86201 co-relation queries the response was YES. [2021-12-17 23:01:20,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50592 conditions, 9367 events. 4732/9367 cut-off events. For 85509/86201 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 79575 event pairs, 934 based on Foata normal form. 90/9110 useless extension candidates. Maximal degree in co-relation 50531. Up to 2391 conditions per place. [2021-12-17 23:01:20,668 INFO L132 encePairwiseOnDemand]: 157/189 looper letters, 385 selfloop transitions, 82 changer transitions 15/545 dead transitions. [2021-12-17 23:01:20,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 545 transitions, 4634 flow [2021-12-17 23:01:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 23:01:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-12-17 23:01:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2244 transitions. [2021-12-17 23:01:20,674 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3830005120327701 [2021-12-17 23:01:20,674 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2244 transitions. [2021-12-17 23:01:20,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2244 transitions. [2021-12-17 23:01:20,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:01:20,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2244 transitions. [2021-12-17 23:01:20,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 72.38709677419355) internal successors, (2244), 31 states have internal predecessors, (2244), 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) [2021-12-17 23:01:20,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 189.0) internal successors, (6048), 32 states have internal predecessors, (6048), 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) [2021-12-17 23:01:20,685 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 189.0) internal successors, (6048), 32 states have internal predecessors, (6048), 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) [2021-12-17 23:01:20,685 INFO L186 Difference]: Start difference. First operand has 326 places, 379 transitions, 2419 flow. Second operand 31 states and 2244 transitions. [2021-12-17 23:01:20,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 545 transitions, 4634 flow [2021-12-17 23:01:20,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 545 transitions, 4528 flow, removed 5 selfloop flow, removed 29 redundant places. [2021-12-17 23:01:20,853 INFO L242 Difference]: Finished difference. Result has 330 places, 388 transitions, 2671 flow [2021-12-17 23:01:20,853 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2671, PETRI_PLACES=330, PETRI_TRANSITIONS=388} [2021-12-17 23:01:20,854 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 160 predicate places. [2021-12-17 23:01:20,854 INFO L470 AbstractCegarLoop]: Abstraction has has 330 places, 388 transitions, 2671 flow [2021-12-17 23:01:20,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 68.16) internal successors, (1704), 25 states have internal predecessors, (1704), 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) [2021-12-17 23:01:20,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:01:20,855 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:01:20,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 23:01:21,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:21,068 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:01:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:01:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash -454610096, now seen corresponding path program 5 times [2021-12-17 23:01:21,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:01:21,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781018333] [2021-12-17 23:01:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:01:21,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:01:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:01:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:22,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:01:22,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781018333] [2021-12-17 23:01:22,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781018333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:01:22,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603099142] [2021-12-17 23:01:22,055 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 23:01:22,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:01:22,057 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) [2021-12-17 23:01:22,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 23:01:22,146 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:01:22,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:01:22,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 23:01:22,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:01:23,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:01:23,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 23:01:24,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-17 23:01:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:24,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:01:25,312 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:25,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 157 [2021-12-17 23:01:25,327 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:25,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 118 [2021-12-17 23:01:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:27,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603099142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:01:27,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:01:27,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33, 28] total 78 [2021-12-17 23:01:27,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133219557] [2021-12-17 23:01:27,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:01:27,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-12-17 23:01:27,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:01:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-12-17 23:01:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=5366, Unknown=1, NotChecked=0, Total=6006 [2021-12-17 23:01:27,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 189 [2021-12-17 23:01:27,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 388 transitions, 2671 flow. Second operand has 78 states, 78 states have (on average 62.57692307692308) internal successors, (4881), 78 states have internal predecessors, (4881), 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) [2021-12-17 23:01:27,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:01:27,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 189 [2021-12-17 23:01:27,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:01:43,079 INFO L129 PetriNetUnfolder]: 14160/27660 cut-off events. [2021-12-17 23:01:43,079 INFO L130 PetriNetUnfolder]: For 258705/259240 co-relation queries the response was YES. [2021-12-17 23:01:43,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146007 conditions, 27660 events. 14160/27660 cut-off events. For 258705/259240 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 265112 event pairs, 1606 based on Foata normal form. 40/27609 useless extension candidates. Maximal degree in co-relation 145943. Up to 6480 conditions per place. [2021-12-17 23:01:43,473 INFO L132 encePairwiseOnDemand]: 133/189 looper letters, 815 selfloop transitions, 373 changer transitions 113/1352 dead transitions. [2021-12-17 23:01:43,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1352 transitions, 13630 flow [2021-12-17 23:01:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2021-12-17 23:01:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-12-17 23:01:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 7424 transitions. [2021-12-17 23:01:43,489 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3507180650037793 [2021-12-17 23:01:43,489 INFO L72 ComplementDD]: Start complementDD. Operand 112 states and 7424 transitions. [2021-12-17 23:01:43,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 7424 transitions. [2021-12-17 23:01:43,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:01:43,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 112 states and 7424 transitions. [2021-12-17 23:01:43,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 113 states, 112 states have (on average 66.28571428571429) internal successors, (7424), 112 states have internal predecessors, (7424), 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) [2021-12-17 23:01:43,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 113 states, 113 states have (on average 189.0) internal successors, (21357), 113 states have internal predecessors, (21357), 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) [2021-12-17 23:01:43,527 INFO L81 ComplementDD]: Finished complementDD. Result has 113 states, 113 states have (on average 189.0) internal successors, (21357), 113 states have internal predecessors, (21357), 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) [2021-12-17 23:01:43,527 INFO L186 Difference]: Start difference. First operand has 330 places, 388 transitions, 2671 flow. Second operand 112 states and 7424 transitions. [2021-12-17 23:01:43,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1352 transitions, 13630 flow [2021-12-17 23:01:44,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1352 transitions, 13443 flow, removed 26 selfloop flow, removed 27 redundant places. [2021-12-17 23:01:44,243 INFO L242 Difference]: Finished difference. Result has 473 places, 673 transitions, 7005 flow [2021-12-17 23:01:44,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=112, PETRI_FLOW=7005, PETRI_PLACES=473, PETRI_TRANSITIONS=673} [2021-12-17 23:01:44,244 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 303 predicate places. [2021-12-17 23:01:44,245 INFO L470 AbstractCegarLoop]: Abstraction has has 473 places, 673 transitions, 7005 flow [2021-12-17 23:01:44,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 62.57692307692308) internal successors, (4881), 78 states have internal predecessors, (4881), 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) [2021-12-17 23:01:44,246 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:01:44,246 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:01:44,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 23:01:44,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:44,460 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:01:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:01:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash 199872088, now seen corresponding path program 6 times [2021-12-17 23:01:44,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:01:44,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018502946] [2021-12-17 23:01:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:01:44,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:01:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:01:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 23:01:44,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:01:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018502946] [2021-12-17 23:01:44,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018502946] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:01:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361809050] [2021-12-17 23:01:44,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 23:01:44,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:01:44,656 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) [2021-12-17 23:01:44,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 23:01:44,745 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-12-17 23:01:44,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:01:44,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 23:01:44,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:01:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 23:01:44,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:01:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 23:01:45,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361809050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:01:45,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:01:45,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 10 [2021-12-17 23:01:45,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937556172] [2021-12-17 23:01:45,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:01:45,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:01:45,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:01:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:01:45,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:01:45,404 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2021-12-17 23:01:45,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 673 transitions, 7005 flow. Second operand has 10 states, 10 states have (on average 159.0) internal successors, (1590), 10 states have internal predecessors, (1590), 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) [2021-12-17 23:01:45,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:01:45,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2021-12-17 23:01:45,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:01:52,501 INFO L129 PetriNetUnfolder]: 9494/25649 cut-off events. [2021-12-17 23:01:52,502 INFO L130 PetriNetUnfolder]: For 591229/594098 co-relation queries the response was YES. [2021-12-17 23:01:52,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180694 conditions, 25649 events. 9494/25649 cut-off events. For 591229/594098 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 294472 event pairs, 2669 based on Foata normal form. 673/25683 useless extension candidates. Maximal degree in co-relation 180572. Up to 5894 conditions per place. [2021-12-17 23:01:53,120 INFO L132 encePairwiseOnDemand]: 180/189 looper letters, 286 selfloop transitions, 179 changer transitions 13/795 dead transitions. [2021-12-17 23:01:53,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 795 transitions, 9369 flow [2021-12-17 23:01:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:01:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-17 23:01:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1300 transitions. [2021-12-17 23:01:53,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8597883597883598 [2021-12-17 23:01:53,123 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1300 transitions. [2021-12-17 23:01:53,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1300 transitions. [2021-12-17 23:01:53,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:01:53,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1300 transitions. [2021-12-17 23:01:53,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.5) internal successors, (1300), 8 states have internal predecessors, (1300), 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) [2021-12-17 23:01:53,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 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) [2021-12-17 23:01:53,126 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 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) [2021-12-17 23:01:53,126 INFO L186 Difference]: Start difference. First operand has 473 places, 673 transitions, 7005 flow. Second operand 8 states and 1300 transitions. [2021-12-17 23:01:53,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 795 transitions, 9369 flow [2021-12-17 23:01:55,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 795 transitions, 8552 flow, removed 365 selfloop flow, removed 43 redundant places. [2021-12-17 23:01:55,214 INFO L242 Difference]: Finished difference. Result has 425 places, 717 transitions, 7369 flow [2021-12-17 23:01:55,215 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=5840, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7369, PETRI_PLACES=425, PETRI_TRANSITIONS=717} [2021-12-17 23:01:55,215 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 255 predicate places. [2021-12-17 23:01:55,218 INFO L470 AbstractCegarLoop]: Abstraction has has 425 places, 717 transitions, 7369 flow [2021-12-17 23:01:55,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 159.0) internal successors, (1590), 10 states have internal predecessors, (1590), 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) [2021-12-17 23:01:55,219 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:01:55,220 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:01:55,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 23:01:55,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 23:01:55,437 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:01:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:01:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash -509217841, now seen corresponding path program 7 times [2021-12-17 23:01:55,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:01:55,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639981771] [2021-12-17 23:01:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:01:55,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:01:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:01:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:56,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:01:56,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639981771] [2021-12-17 23:01:56,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639981771] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:01:56,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061618044] [2021-12-17 23:01:56,476 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 23:01:56,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:01:56,479 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) [2021-12-17 23:01:56,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 23:01:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:01:56,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 23:01:56,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:01:57,852 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-17 23:01:57,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2021-12-17 23:01:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:57,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:01:58,193 INFO L354 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2021-12-17 23:01:58,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2021-12-17 23:01:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:59,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061618044] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:01:59,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:01:59,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 21] total 60 [2021-12-17 23:01:59,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335523202] [2021-12-17 23:01:59,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:01:59,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-17 23:01:59,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:01:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-17 23:01:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=2990, Unknown=0, NotChecked=0, Total=3540 [2021-12-17 23:01:59,284 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 189 [2021-12-17 23:01:59,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 717 transitions, 7369 flow. Second operand has 60 states, 60 states have (on average 69.86666666666666) internal successors, (4192), 60 states have internal predecessors, (4192), 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) [2021-12-17 23:01:59,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:01:59,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 189 [2021-12-17 23:01:59,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:23,367 INFO L129 PetriNetUnfolder]: 33014/65385 cut-off events. [2021-12-17 23:02:23,367 INFO L130 PetriNetUnfolder]: For 2073278/2074239 co-relation queries the response was YES. [2021-12-17 23:02:24,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 541550 conditions, 65385 events. 33014/65385 cut-off events. For 2073278/2074239 co-relation queries the response was YES. Maximal size of possible extension queue 2335. Compared 702982 event pairs, 4969 based on Foata normal form. 100/65344 useless extension candidates. Maximal degree in co-relation 541441. Up to 19102 conditions per place. [2021-12-17 23:02:25,237 INFO L132 encePairwiseOnDemand]: 140/189 looper letters, 1022 selfloop transitions, 562 changer transitions 240/1880 dead transitions. [2021-12-17 23:02:25,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 1880 transitions, 25946 flow [2021-12-17 23:02:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-17 23:02:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-12-17 23:02:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 6807 transitions. [2021-12-17 23:02:25,243 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.38314758527524484 [2021-12-17 23:02:25,243 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 6807 transitions. [2021-12-17 23:02:25,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 6807 transitions. [2021-12-17 23:02:25,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:25,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 6807 transitions. [2021-12-17 23:02:25,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 72.41489361702128) internal successors, (6807), 94 states have internal predecessors, (6807), 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) [2021-12-17 23:02:25,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 189.0) internal successors, (17955), 95 states have internal predecessors, (17955), 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) [2021-12-17 23:02:25,261 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 189.0) internal successors, (17955), 95 states have internal predecessors, (17955), 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) [2021-12-17 23:02:25,262 INFO L186 Difference]: Start difference. First operand has 425 places, 717 transitions, 7369 flow. Second operand 94 states and 6807 transitions. [2021-12-17 23:02:25,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 1880 transitions, 25946 flow [2021-12-17 23:02:36,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 1880 transitions, 25106 flow, removed 419 selfloop flow, removed 1 redundant places. [2021-12-17 23:02:36,775 INFO L242 Difference]: Finished difference. Result has 572 places, 1077 transitions, 14430 flow [2021-12-17 23:02:36,776 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=7219, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=14430, PETRI_PLACES=572, PETRI_TRANSITIONS=1077} [2021-12-17 23:02:36,776 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 402 predicate places. [2021-12-17 23:02:36,777 INFO L470 AbstractCegarLoop]: Abstraction has has 572 places, 1077 transitions, 14430 flow [2021-12-17 23:02:36,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 69.86666666666666) internal successors, (4192), 60 states have internal predecessors, (4192), 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) [2021-12-17 23:02:36,778 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:36,779 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:02:36,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 23:02:36,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:36,990 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:02:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 185128339, now seen corresponding path program 8 times [2021-12-17 23:02:36,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:36,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875993545] [2021-12-17 23:02:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:36,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:39,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:39,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875993545] [2021-12-17 23:02:39,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875993545] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:39,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909666485] [2021-12-17 23:02:39,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:02:39,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:39,801 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) [2021-12-17 23:02:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 23:02:39,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:02:39,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:02:39,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-17 23:02:39,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:41,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:02:41,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 23:02:41,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:02:41,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 23:02:42,091 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 23:02:42,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-12-17 23:02:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:42,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:02:43,315 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:43,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1015 treesize of output 963 [2021-12-17 23:02:43,338 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:43,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 864 treesize of output 804 [2021-12-17 23:02:43,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:43,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 756 treesize of output 588 [2021-12-17 23:02:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:51,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909666485] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:02:51,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:02:51,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32, 32] total 91 [2021-12-17 23:02:51,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902610894] [2021-12-17 23:02:51,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:02:51,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2021-12-17 23:02:51,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-12-17 23:02:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=7498, Unknown=15, NotChecked=0, Total=8190 [2021-12-17 23:02:51,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189 [2021-12-17 23:02:51,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 1077 transitions, 14430 flow. Second operand has 91 states, 91 states have (on average 56.527472527472526) internal successors, (5144), 91 states have internal predecessors, (5144), 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) [2021-12-17 23:02:51,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:51,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189 [2021-12-17 23:02:51,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand