./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-dec-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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:50:34,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:50:34,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:50:34,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:50:34,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:50:34,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:50:34,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:50:34,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:50:34,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:50:34,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:50:34,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:50:34,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:50:34,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:50:34,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:50:34,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:50:34,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:50:34,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:50:34,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:50:34,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:50:34,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:50:34,409 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:50:34,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:50:34,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:50:34,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:50:34,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:50:34,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:50:34,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:50:34,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:50:34,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:50:34,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:50:34,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:50:34,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:50:34,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:50:34,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:50:34,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:50:34,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:50:34,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:50:34,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:50:34,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:50:34,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:50:34,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:50:34,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:50:34,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:50:34,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:50:34,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:50:34,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:50:34,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:50:34,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:50:34,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:50:34,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:50:34,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:50:34,451 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:50:34,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:50:34,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:50:34,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:50:34,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:50:34,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:50:34,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:50:34,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:50:34,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:50:34,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:50:34,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:50:34,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:50:34,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:50:34,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:50:34,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:50:34,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:50:34,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:50:34,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:50:34,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:50:34,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:50:34,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:50:34,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:50:34,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:50:34,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:50:34,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:50:34,456 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a [2022-07-22 21:50:34,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:50:34,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:50:34,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:50:34,675 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:50:34,676 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:50:34,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-07-22 21:50:34,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46445fc20/39b09bd7e0fe426295caa343ade10cf9/FLAGb425616b3 [2022-07-22 21:50:35,069 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:50:35,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-07-22 21:50:35,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46445fc20/39b09bd7e0fe426295caa343ade10cf9/FLAGb425616b3 [2022-07-22 21:50:35,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46445fc20/39b09bd7e0fe426295caa343ade10cf9 [2022-07-22 21:50:35,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:50:35,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:50:35,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:50:35,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:50:35,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:50:35,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cd2013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35, skipping insertion in model container [2022-07-22 21:50:35,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:50:35,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:50:35,285 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-dec-subseq.wvr.c[2924,2937] [2022-07-22 21:50:35,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:50:35,294 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:50:35,308 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-dec-subseq.wvr.c[2924,2937] [2022-07-22 21:50:35,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:50:35,319 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:50:35,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35 WrapperNode [2022-07-22 21:50:35,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:50:35,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:50:35,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:50:35,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:50:35,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,358 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-07-22 21:50:35,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:50:35,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:50:35,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:50:35,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:50:35,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:50:35,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:50:35,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:50:35,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:50:35,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (1/1) ... [2022-07-22 21:50:35,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:50:35,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:50:35,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 21:50:35,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 21:50:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:50:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:50:35,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:50:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:50:35,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:50:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:50:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:50:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:50:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:50:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:50:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 21:50:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:50:35,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:50:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:50:35,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:50:35,463 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:50:35,568 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:50:35,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:50:35,908 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:50:35,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:50:35,960 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 21:50:35,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:50:35 BoogieIcfgContainer [2022-07-22 21:50:35,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:50:35,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:50:35,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:50:35,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:50:35,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:50:35" (1/3) ... [2022-07-22 21:50:35,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c55005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:50:35, skipping insertion in model container [2022-07-22 21:50:35,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:35" (2/3) ... [2022-07-22 21:50:35,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c55005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:50:35, skipping insertion in model container [2022-07-22 21:50:35,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:50:35" (3/3) ... [2022-07-22 21:50:35,971 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-07-22 21:50:35,974 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:50:35,981 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:50:35,981 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:50:35,981 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:50:36,048 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 21:50:36,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 189 transitions, 394 flow [2022-07-22 21:50:36,162 INFO L129 PetriNetUnfolder]: 15/187 cut-off events. [2022-07-22 21:50:36,162 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:50:36,164 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 100 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. [2022-07-22 21:50:36,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 189 transitions, 394 flow [2022-07-22 21:50:36,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 178 transitions, 368 flow [2022-07-22 21:50:36,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:50:36,187 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1083d76a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@644f2f49 [2022-07-22 21:50:36,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-22 21:50:36,231 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-22 21:50:36,231 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:50:36,231 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:36,232 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:36,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 577602676, now seen corresponding path program 1 times [2022-07-22 21:50:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:36,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540203629] [2022-07-22 21:50:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:50:36,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:36,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540203629] [2022-07-22 21:50:36,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540203629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:36,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:36,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:50:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066469814] [2022-07-22 21:50:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:36,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:50:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:50:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:50:36,442 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2022-07-22 21:50:36,444 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.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:36,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:36,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2022-07-22 21:50:36,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:36,485 INFO L129 PetriNetUnfolder]: 14/193 cut-off events. [2022-07-22 21:50:36,485 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-22 21:50:36,486 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 172 event pairs, 3 based on Foata normal form. 15/194 useless extension candidates. Maximal degree in co-relation 147. Up to 20 conditions per place. [2022-07-22 21:50:36,489 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 7 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2022-07-22 21:50:36,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 362 flow [2022-07-22 21:50:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:50:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:50:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2022-07-22 21:50:36,502 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9497354497354498 [2022-07-22 21:50:36,503 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2022-07-22 21:50:36,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2022-07-22 21:50:36,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:36,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2022-07-22 21:50:36,511 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) [2022-07-22 21:50:36,516 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) [2022-07-22 21:50:36,517 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) [2022-07-22 21:50:36,519 INFO L186 Difference]: Start difference. First operand has 170 places, 178 transitions, 368 flow. Second operand 2 states and 359 transitions. [2022-07-22 21:50:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 362 flow [2022-07-22 21:50:36,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 168 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:50:36,526 INFO L242 Difference]: Finished difference. Result has 167 places, 162 transitions, 328 flow [2022-07-22 21:50:36,528 INFO L262 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} [2022-07-22 21:50:36,531 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2022-07-22 21:50:36,531 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 328 flow [2022-07-22 21:50:36,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:36,532 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:36,532 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:36,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:50:36,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1660907215, now seen corresponding path program 1 times [2022-07-22 21:50:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:36,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524398025] [2022-07-22 21:50:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:50:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524398025] [2022-07-22 21:50:36,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524398025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:36,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:36,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:50:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748750798] [2022-07-22 21:50:36,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:36,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:50:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:50:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:50:36,855 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 189 [2022-07-22 21:50:36,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:36,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:36,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 189 [2022-07-22 21:50:36,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:37,055 INFO L129 PetriNetUnfolder]: 56/309 cut-off events. [2022-07-22 21:50:37,055 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 21:50:37,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 309 events. 56/309 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 848 event pairs, 12 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 445. Up to 64 conditions per place. [2022-07-22 21:50:37,059 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 45 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2022-07-22 21:50:37,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 447 flow [2022-07-22 21:50:37,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:50:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:50:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2022-07-22 21:50:37,062 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2022-07-22 21:50:37,062 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2022-07-22 21:50:37,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2022-07-22 21:50:37,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:37,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2022-07-22 21:50:37,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,067 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) [2022-07-22 21:50:37,068 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) [2022-07-22 21:50:37,068 INFO L186 Difference]: Start difference. First operand has 167 places, 162 transitions, 328 flow. Second operand 6 states and 837 transitions. [2022-07-22 21:50:37,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 447 flow [2022-07-22 21:50:37,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 171 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:50:37,074 INFO L242 Difference]: Finished difference. Result has 167 places, 163 transitions, 346 flow [2022-07-22 21:50:37,074 INFO L262 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-07-22 21:50:37,075 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2022-07-22 21:50:37,075 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 346 flow [2022-07-22 21:50:37,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,076 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:37,076 INFO L200 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] [2022-07-22 21:50:37,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:50:37,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 730860721, now seen corresponding path program 1 times [2022-07-22 21:50:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:37,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804276562] [2022-07-22 21:50:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:50:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:37,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804276562] [2022-07-22 21:50:37,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804276562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:37,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:37,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:50:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393188457] [2022-07-22 21:50:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:37,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:50:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:50:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:50:37,257 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 189 [2022-07-22 21:50:37,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:37,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 189 [2022-07-22 21:50:37,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:37,398 INFO L129 PetriNetUnfolder]: 57/353 cut-off events. [2022-07-22 21:50:37,399 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-22 21:50:37,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 353 events. 57/353 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 981 event pairs, 12 based on Foata normal form. 4/338 useless extension candidates. Maximal degree in co-relation 525. Up to 60 conditions per place. [2022-07-22 21:50:37,400 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 46 selfloop transitions, 8 changer transitions 7/182 dead transitions. [2022-07-22 21:50:37,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 182 transitions, 511 flow [2022-07-22 21:50:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:50:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:50:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1158 transitions. [2022-07-22 21:50:37,403 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7658730158730159 [2022-07-22 21:50:37,404 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1158 transitions. [2022-07-22 21:50:37,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1158 transitions. [2022-07-22 21:50:37,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:37,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1158 transitions. [2022-07-22 21:50:37,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.75) internal successors, (1158), 8 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,408 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) [2022-07-22 21:50:37,409 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) [2022-07-22 21:50:37,409 INFO L186 Difference]: Start difference. First operand has 167 places, 163 transitions, 346 flow. Second operand 8 states and 1158 transitions. [2022-07-22 21:50:37,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 182 transitions, 511 flow [2022-07-22 21:50:37,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 501 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:50:37,414 INFO L242 Difference]: Finished difference. Result has 172 places, 164 transitions, 364 flow [2022-07-22 21:50:37,414 INFO L262 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=364, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2022-07-22 21:50:37,416 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-22 21:50:37,416 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 364 flow [2022-07-22 21:50:37,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,417 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:37,417 INFO L200 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] [2022-07-22 21:50:37,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:50:37,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1033182428, now seen corresponding path program 1 times [2022-07-22 21:50:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:37,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099717251] [2022-07-22 21:50:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:37,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:37,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:37,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099717251] [2022-07-22 21:50:37,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099717251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:37,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:37,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 21:50:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143015807] [2022-07-22 21:50:37,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:37,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 21:50:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 21:50:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 21:50:37,542 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-07-22 21:50:37,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:37,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-07-22 21:50:37,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:37,644 INFO L129 PetriNetUnfolder]: 156/581 cut-off events. [2022-07-22 21:50:37,644 INFO L130 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-07-22 21:50:37,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 581 events. 156/581 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2610 event pairs, 14 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 959. Up to 141 conditions per place. [2022-07-22 21:50:37,648 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 44 selfloop transitions, 11 changer transitions 0/194 dead transitions. [2022-07-22 21:50:37,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 194 transitions, 558 flow [2022-07-22 21:50:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:50:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:50:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2022-07-22 21:50:37,650 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.870899470899471 [2022-07-22 21:50:37,651 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2022-07-22 21:50:37,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2022-07-22 21:50:37,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:37,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2022-07-22 21:50:37,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,656 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) [2022-07-22 21:50:37,657 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) [2022-07-22 21:50:37,658 INFO L186 Difference]: Start difference. First operand has 172 places, 164 transitions, 364 flow. Second operand 5 states and 823 transitions. [2022-07-22 21:50:37,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 194 transitions, 558 flow [2022-07-22 21:50:37,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-07-22 21:50:37,662 INFO L242 Difference]: Finished difference. Result has 172 places, 174 transitions, 437 flow [2022-07-22 21:50:37,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=172, PETRI_TRANSITIONS=174} [2022-07-22 21:50:37,663 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-22 21:50:37,667 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 174 transitions, 437 flow [2022-07-22 21:50:37,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,668 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:37,668 INFO L200 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] [2022-07-22 21:50:37,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:50:37,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2124401224, now seen corresponding path program 2 times [2022-07-22 21:50:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:37,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14066756] [2022-07-22 21:50:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:50:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:37,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14066756] [2022-07-22 21:50:37,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14066756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:37,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:37,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:50:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524707697] [2022-07-22 21:50:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:37,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:50:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:50:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:50:37,745 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2022-07-22 21:50:37,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 174 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:37,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2022-07-22 21:50:37,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:37,835 INFO L129 PetriNetUnfolder]: 106/528 cut-off events. [2022-07-22 21:50:37,835 INFO L130 PetriNetUnfolder]: For 330/355 co-relation queries the response was YES. [2022-07-22 21:50:37,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 528 events. 106/528 cut-off events. For 330/355 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2395 event pairs, 13 based on Foata normal form. 8/515 useless extension candidates. Maximal degree in co-relation 985. Up to 100 conditions per place. [2022-07-22 21:50:37,838 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 51 selfloop transitions, 2 changer transitions 4/190 dead transitions. [2022-07-22 21:50:37,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 190 transitions, 630 flow [2022-07-22 21:50:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:50:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:50:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2022-07-22 21:50:37,840 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7767195767195767 [2022-07-22 21:50:37,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2022-07-22 21:50:37,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2022-07-22 21:50:37,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:37,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2022-07-22 21:50:37,842 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) [2022-07-22 21:50:37,843 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) [2022-07-22 21:50:37,843 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) [2022-07-22 21:50:37,844 INFO L186 Difference]: Start difference. First operand has 172 places, 174 transitions, 437 flow. Second operand 5 states and 734 transitions. [2022-07-22 21:50:37,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 190 transitions, 630 flow [2022-07-22 21:50:37,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 190 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:50:37,847 INFO L242 Difference]: Finished difference. Result has 179 places, 175 transitions, 453 flow [2022-07-22 21:50:37,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-07-22 21:50:37,848 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 9 predicate places. [2022-07-22 21:50:37,849 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 453 flow [2022-07-22 21:50:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,849 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:37,849 INFO L200 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] [2022-07-22 21:50:37,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:50:37,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -8030758, now seen corresponding path program 1 times [2022-07-22 21:50:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:37,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032199711] [2022-07-22 21:50:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:50:37,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:37,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032199711] [2022-07-22 21:50:37,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032199711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:37,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:37,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:50:37,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19506751] [2022-07-22 21:50:37,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:37,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:50:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:37,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:50:37,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:50:37,902 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 189 [2022-07-22 21:50:37,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:37,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 189 [2022-07-22 21:50:37,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:37,951 INFO L129 PetriNetUnfolder]: 78/488 cut-off events. [2022-07-22 21:50:37,951 INFO L130 PetriNetUnfolder]: For 286/308 co-relation queries the response was YES. [2022-07-22 21:50:37,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 488 events. 78/488 cut-off events. For 286/308 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1966 event pairs, 9 based on Foata normal form. 11/480 useless extension candidates. Maximal degree in co-relation 880. Up to 106 conditions per place. [2022-07-22 21:50:37,954 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 29 selfloop transitions, 2 changer transitions 2/185 dead transitions. [2022-07-22 21:50:37,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 570 flow [2022-07-22 21:50:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:50:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:50:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-07-22 21:50:37,956 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.908289241622575 [2022-07-22 21:50:37,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-07-22 21:50:37,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-07-22 21:50:37,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:37,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-07-22 21:50:37,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,958 INFO L186 Difference]: Start difference. First operand has 179 places, 175 transitions, 453 flow. Second operand 3 states and 515 transitions. [2022-07-22 21:50:37,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 570 flow [2022-07-22 21:50:37,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 185 transitions, 564 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-22 21:50:37,962 INFO L242 Difference]: Finished difference. Result has 177 places, 176 transitions, 463 flow [2022-07-22 21:50:37,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=177, PETRI_TRANSITIONS=176} [2022-07-22 21:50:37,963 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 7 predicate places. [2022-07-22 21:50:37,963 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 176 transitions, 463 flow [2022-07-22 21:50:37,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:37,964 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:37,964 INFO L200 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] [2022-07-22 21:50:37,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:50:37,964 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1086060663, now seen corresponding path program 1 times [2022-07-22 21:50:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:37,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929892915] [2022-07-22 21:50:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:38,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929892915] [2022-07-22 21:50:38,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929892915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:38,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:38,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:50:38,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734136457] [2022-07-22 21:50:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:50:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:50:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:50:38,027 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 189 [2022-07-22 21:50:38,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 176 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:38,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:38,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 189 [2022-07-22 21:50:38,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:38,137 INFO L129 PetriNetUnfolder]: 77/620 cut-off events. [2022-07-22 21:50:38,138 INFO L130 PetriNetUnfolder]: For 367/396 co-relation queries the response was YES. [2022-07-22 21:50:38,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 620 events. 77/620 cut-off events. For 367/396 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2606 event pairs, 16 based on Foata normal form. 15/608 useless extension candidates. Maximal degree in co-relation 1125. Up to 110 conditions per place. [2022-07-22 21:50:38,140 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 38 selfloop transitions, 8 changer transitions 22/202 dead transitions. [2022-07-22 21:50:38,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 202 transitions, 685 flow [2022-07-22 21:50:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:50:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:50:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1361 transitions. [2022-07-22 21:50:38,143 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8001175778953556 [2022-07-22 21:50:38,143 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1361 transitions. [2022-07-22 21:50:38,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1361 transitions. [2022-07-22 21:50:38,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:38,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1361 transitions. [2022-07-22 21:50:38,146 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) [2022-07-22 21:50:38,147 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) [2022-07-22 21:50:38,148 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) [2022-07-22 21:50:38,148 INFO L186 Difference]: Start difference. First operand has 177 places, 176 transitions, 463 flow. Second operand 9 states and 1361 transitions. [2022-07-22 21:50:38,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 202 transitions, 685 flow [2022-07-22 21:50:38,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 202 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:50:38,152 INFO L242 Difference]: Finished difference. Result has 186 places, 177 transitions, 489 flow [2022-07-22 21:50:38,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=489, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2022-07-22 21:50:38,152 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 16 predicate places. [2022-07-22 21:50:38,153 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 489 flow [2022-07-22 21:50:38,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:38,153 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:38,153 INFO L200 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] [2022-07-22 21:50:38,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:50:38,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -751624308, now seen corresponding path program 1 times [2022-07-22 21:50:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:38,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468972289] [2022-07-22 21:50:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:50:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:39,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468972289] [2022-07-22 21:50:39,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468972289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:50:39,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819461508] [2022-07-22 21:50:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:50:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:50:39,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:50:39,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 21:50:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:39,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 21:50:39,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:50:40,877 INFO L390 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 15 treesize of output 7 [2022-07-22 21:50:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:40,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:50:41,272 INFO L356 Elim1Store]: treesize reduction 23, result has 77.2 percent of original size [2022-07-22 21:50:41,272 INFO L390 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 72 treesize of output 101 [2022-07-22 21:50:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:42,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819461508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:50:42,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:50:42,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 19] total 63 [2022-07-22 21:50:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918106464] [2022-07-22 21:50:42,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:50:42,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-22 21:50:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-22 21:50:42,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3361, Unknown=0, NotChecked=0, Total=3906 [2022-07-22 21:50:42,465 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189 [2022-07-22 21:50:42,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 489 flow. Second operand has 63 states, 63 states have (on average 59.476190476190474) internal successors, (3747), 63 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:42,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:42,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189 [2022-07-22 21:50:42,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:55,044 INFO L129 PetriNetUnfolder]: 9164/17955 cut-off events. [2022-07-22 21:50:55,044 INFO L130 PetriNetUnfolder]: For 11386/11386 co-relation queries the response was YES. [2022-07-22 21:50:55,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45147 conditions, 17955 events. 9164/17955 cut-off events. For 11386/11386 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 165866 event pairs, 721 based on Foata normal form. 32/17327 useless extension candidates. Maximal degree in co-relation 45133. Up to 2845 conditions per place. [2022-07-22 21:50:55,181 INFO L132 encePairwiseOnDemand]: 142/189 looper letters, 825 selfloop transitions, 284 changer transitions 218/1376 dead transitions. [2022-07-22 21:50:55,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1376 transitions, 7649 flow [2022-07-22 21:50:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-07-22 21:50:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2022-07-22 21:50:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 8023 transitions. [2022-07-22 21:50:55,197 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3395978835978836 [2022-07-22 21:50:55,197 INFO L72 ComplementDD]: Start complementDD. Operand 125 states and 8023 transitions. [2022-07-22 21:50:55,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 8023 transitions. [2022-07-22 21:50:55,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:55,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 125 states and 8023 transitions. [2022-07-22 21:50:55,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 126 states, 125 states have (on average 64.184) internal successors, (8023), 125 states have internal predecessors, (8023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:55,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 126 states, 126 states have (on average 189.0) internal successors, (23814), 126 states have internal predecessors, (23814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:55,256 INFO L81 ComplementDD]: Finished complementDD. Result has 126 states, 126 states have (on average 189.0) internal successors, (23814), 126 states have internal predecessors, (23814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:55,256 INFO L186 Difference]: Start difference. First operand has 186 places, 177 transitions, 489 flow. Second operand 125 states and 8023 transitions. [2022-07-22 21:50:55,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 1376 transitions, 7649 flow [2022-07-22 21:50:55,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 1376 transitions, 7615 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-22 21:50:55,294 INFO L242 Difference]: Finished difference. Result has 371 places, 492 transitions, 3069 flow [2022-07-22 21:50:55,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=125, PETRI_FLOW=3069, PETRI_PLACES=371, PETRI_TRANSITIONS=492} [2022-07-22 21:50:55,297 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 201 predicate places. [2022-07-22 21:50:55,298 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 492 transitions, 3069 flow [2022-07-22 21:50:55,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 59.476190476190474) internal successors, (3747), 63 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:55,308 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:55,309 INFO L200 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] [2022-07-22 21:50:55,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 21:50:55,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:50:55,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1738378008, now seen corresponding path program 2 times [2022-07-22 21:50:55,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:55,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11887776] [2022-07-22 21:50:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:56,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11887776] [2022-07-22 21:50:56,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11887776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:50:56,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616643097] [2022-07-22 21:50:56,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:50:56,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:50:56,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:50:56,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:50:56,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 21:50:56,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:50:56,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:50:56,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 21:50:56,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:50:56,870 INFO L390 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 [2022-07-22 21:50:57,211 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 21:50:57,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 21:50:58,067 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 21:50:58,067 INFO L390 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 [2022-07-22 21:50:58,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:50:58,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:50:59,036 INFO L390 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 [2022-07-22 21:50:59,321 INFO L356 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-07-22 21:50:59,322 INFO L390 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 30 treesize of output 36 [2022-07-22 21:50:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:59,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:51:01,082 INFO L356 Elim1Store]: treesize reduction 25, result has 84.2 percent of original size [2022-07-22 21:51:01,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1871 treesize of output 1727 [2022-07-22 21:51:01,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:01,114 INFO L390 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 1590 treesize of output 1531 [2022-07-22 21:51:01,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:01,158 INFO L390 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 1482 treesize of output 1315 [2022-07-22 21:51:01,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:01,181 INFO L390 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 1266 treesize of output 1187 [2022-07-22 21:51:01,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:01,203 INFO L390 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 1170 treesize of output 995 [2022-07-22 21:51:11,803 INFO L390 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 10 treesize of output 8 [2022-07-22 21:51:11,807 INFO L390 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 10 treesize of output 8 [2022-07-22 21:51:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:11,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616643097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:51:11,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:51:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 36, 32] total 89 [2022-07-22 21:51:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556030903] [2022-07-22 21:51:11,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:51:11,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-22 21:51:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:51:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-22 21:51:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=7037, Unknown=25, NotChecked=0, Total=7832 [2022-07-22 21:51:11,903 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189 [2022-07-22 21:51:11,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 492 transitions, 3069 flow. Second operand has 89 states, 89 states have (on average 56.449438202247194) internal successors, (5024), 89 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:51:11,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:51:11,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189 [2022-07-22 21:51:11,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:51:30,922 INFO L129 PetriNetUnfolder]: 14333/26467 cut-off events. [2022-07-22 21:51:30,922 INFO L130 PetriNetUnfolder]: For 245732/245798 co-relation queries the response was YES. [2022-07-22 21:51:31,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122482 conditions, 26467 events. 14333/26467 cut-off events. For 245732/245798 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 246850 event pairs, 2578 based on Foata normal form. 26/26449 useless extension candidates. Maximal degree in co-relation 122400. Up to 14574 conditions per place. [2022-07-22 21:51:31,271 INFO L132 encePairwiseOnDemand]: 131/189 looper letters, 956 selfloop transitions, 545 changer transitions 39/1587 dead transitions. [2022-07-22 21:51:31,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1587 transitions, 14762 flow [2022-07-22 21:51:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-07-22 21:51:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2022-07-22 21:51:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 7520 transitions. [2022-07-22 21:51:31,289 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3084368975841844 [2022-07-22 21:51:31,289 INFO L72 ComplementDD]: Start complementDD. Operand 129 states and 7520 transitions. [2022-07-22 21:51:31,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 7520 transitions. [2022-07-22 21:51:31,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:51:31,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 129 states and 7520 transitions. [2022-07-22 21:51:31,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 130 states, 129 states have (on average 58.29457364341085) internal successors, (7520), 129 states have internal predecessors, (7520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:51:31,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 130 states, 130 states have (on average 189.0) internal successors, (24570), 130 states have internal predecessors, (24570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:51:31,336 INFO L81 ComplementDD]: Finished complementDD. Result has 130 states, 130 states have (on average 189.0) internal successors, (24570), 130 states have internal predecessors, (24570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:51:31,337 INFO L186 Difference]: Start difference. First operand has 371 places, 492 transitions, 3069 flow. Second operand 129 states and 7520 transitions. [2022-07-22 21:51:31,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 1587 transitions, 14762 flow [2022-07-22 21:51:32,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1587 transitions, 13538 flow, removed 576 selfloop flow, removed 30 redundant places. [2022-07-22 21:51:32,451 INFO L242 Difference]: Finished difference. Result has 493 places, 1007 transitions, 8667 flow [2022-07-22 21:51:32,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2726, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=8667, PETRI_PLACES=493, PETRI_TRANSITIONS=1007} [2022-07-22 21:51:32,452 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 323 predicate places. [2022-07-22 21:51:32,452 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 1007 transitions, 8667 flow [2022-07-22 21:51:32,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 56.449438202247194) internal successors, (5024), 89 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:51:32,454 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:51:32,454 INFO L200 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] [2022-07-22 21:51:32,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 21:51:32,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-22 21:51:32,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:51:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:51:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -620764720, now seen corresponding path program 3 times [2022-07-22 21:51:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:51:32,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535555798] [2022-07-22 21:51:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:51:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:51:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:51:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:51:33,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535555798] [2022-07-22 21:51:33,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535555798] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:51:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341803219] [2022-07-22 21:51:33,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:51:33,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:51:33,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:51:33,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:51:33,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 21:51:33,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 21:51:33,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:51:33,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-22 21:51:33,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:51:33,804 INFO L390 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 [2022-07-22 21:51:33,830 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 21:51:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 21:51:34,172 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-22 21:51:34,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 21:51:34,429 INFO L390 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 [2022-07-22 21:51:35,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:51:35,231 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-22 21:51:35,232 INFO L390 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 21 [2022-07-22 21:51:35,393 INFO L390 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 [2022-07-22 21:51:36,549 INFO L390 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 [2022-07-22 21:51:37,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:51:37,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 21:51:37,532 INFO L356 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2022-07-22 21:51:37,533 INFO L390 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 [2022-07-22 21:51:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:37,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:51:38,022 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:38,117 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:38,612 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse1 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) .cse2))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse3 c_~A~0.base) .cse2))))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse4 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod c_~ok~0 256) 0)))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:38,809 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)))))))) (forall ((v_~A~0.base_19 Int)) (or (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse4 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse2 v_~A~0.base_19) .cse3)) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) .cse3))))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:38,866 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse3 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse1 v_~A~0.base_19) .cse2)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse3 v_~A~0.base_19) .cse2))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse4 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19))))) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:38,897 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse3 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse1 v_~A~0.base_19) .cse2)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse3 v_~A~0.base_19) .cse2)))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse4 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))))) (not (= (mod c_~ok~0 256) 0)))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:39,047 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse3 (select .cse1 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse1 v_~A~0.base_19) .cse2) (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) .cse2)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:39,167 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 v_~A~0.base_19) .cse3))) (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) .cse3)) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19))))))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:41,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:41,418 INFO L390 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 62 treesize of output 51 [2022-07-22 21:51:41,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:41,442 INFO L390 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 3382 treesize of output 3146 [2022-07-22 21:51:41,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:41,470 INFO L390 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 3126 treesize of output 2375 [2022-07-22 21:51:41,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:41,492 INFO L390 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 2358 treesize of output 1991 [2022-07-22 21:51:41,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:41,523 INFO L390 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 1974 treesize of output 1799 [2022-07-22 21:51:42,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:42,392 INFO L390 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 121 treesize of output 85 [2022-07-22 21:51:42,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:42,422 INFO L390 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 16844 treesize of output 15490 [2022-07-22 21:51:42,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:42,505 INFO L390 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 15436 treesize of output 12028 [2022-07-22 21:51:42,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:42,576 INFO L390 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 11980 treesize of output 9916 [2022-07-22 21:51:42,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:42,649 INFO L390 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 9868 treesize of output 8860 [2022-07-22 21:51:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 21:51:58,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341803219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:51:58,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:51:58,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 35] total 91 [2022-07-22 21:51:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672790448] [2022-07-22 21:51:58,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:51:58,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-22 21:51:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:51:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-22 21:51:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=5967, Unknown=75, NotChecked=1352, Total=8190 [2022-07-22 21:51:58,404 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 189 [2022-07-22 21:51:58,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1007 transitions, 8667 flow. Second operand has 91 states, 91 states have (on average 57.21978021978022) internal successors, (5207), 91 states have internal predecessors, (5207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:51:58,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:51:58,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 189 [2022-07-22 21:51:58,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:52:04,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse2 (not (<= 0 c_~end~0))) (.cse5 (not (= (mod c_~ok~0 256) 0))) (.cse8 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~A~0.offset Int)) (or (< c_~last~0 (select (select |c_#memory_int| c_~A~0.base) (+ ~A~0.offset (* c_~i~0 4)))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse4 (select .cse3 c_~queue~0.base))) (or (not (= (select (select .cse3 c_~A~0.base) (+ ~A~0.offset (* c_~i~0 4))) (select .cse4 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))))))) (or .cse5 (forall ((~A~0.offset Int) (v_ArrVal_200 (Array Int Int))) (let ((.cse6 (+ ~A~0.offset (* c_~i~0 4)))) (or (< c_~last~0 (select (select |c_#memory_int| c_~A~0.base) .cse6)) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse7 c_~A~0.base) .cse6) (select (select .cse7 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))))) .cse8) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 .cse1 .cse2 (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse9 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse9 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) .cse5) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse10 (select .cse11 c_~queue~0.base))) (or (<= (select .cse10 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse11 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse10 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) .cse8))) is different from false [2022-07-22 21:52:14,315 INFO L129 PetriNetUnfolder]: 20335/38080 cut-off events. [2022-07-22 21:52:14,315 INFO L130 PetriNetUnfolder]: For 575177/575262 co-relation queries the response was YES. [2022-07-22 21:52:15,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241579 conditions, 38080 events. 20335/38080 cut-off events. For 575177/575262 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 370685 event pairs, 4196 based on Foata normal form. 36/38001 useless extension candidates. Maximal degree in co-relation 241474. Up to 24345 conditions per place. [2022-07-22 21:52:15,341 INFO L132 encePairwiseOnDemand]: 132/189 looper letters, 1113 selfloop transitions, 658 changer transitions 5/1825 dead transitions. [2022-07-22 21:52:15,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 1825 transitions, 20723 flow [2022-07-22 21:52:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-22 21:52:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-07-22 21:52:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 3754 transitions. [2022-07-22 21:52:15,347 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.32036183649086875 [2022-07-22 21:52:15,347 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 3754 transitions. [2022-07-22 21:52:15,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 3754 transitions. [2022-07-22 21:52:15,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:52:15,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 3754 transitions. [2022-07-22 21:52:15,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 60.54838709677419) internal successors, (3754), 62 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:52:15,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 189.0) internal successors, (11907), 63 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:52:15,362 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 189.0) internal successors, (11907), 63 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:52:15,362 INFO L186 Difference]: Start difference. First operand has 493 places, 1007 transitions, 8667 flow. Second operand 62 states and 3754 transitions. [2022-07-22 21:52:15,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 1825 transitions, 20723 flow [2022-07-22 21:52:19,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 1825 transitions, 19710 flow, removed 451 selfloop flow, removed 49 redundant places. [2022-07-22 21:52:19,038 INFO L242 Difference]: Finished difference. Result has 519 places, 1484 transitions, 15820 flow [2022-07-22 21:52:19,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=8011, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=15820, PETRI_PLACES=519, PETRI_TRANSITIONS=1484} [2022-07-22 21:52:19,040 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 349 predicate places. [2022-07-22 21:52:19,040 INFO L495 AbstractCegarLoop]: Abstraction has has 519 places, 1484 transitions, 15820 flow [2022-07-22 21:52:19,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 57.21978021978022) internal successors, (5207), 91 states have internal predecessors, (5207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:52:19,041 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:52:19,041 INFO L200 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] [2022-07-22 21:52:19,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 21:52:19,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:52:19,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:52:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:52:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1898873328, now seen corresponding path program 4 times [2022-07-22 21:52:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:52:19,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693187967] [2022-07-22 21:52:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:52:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:52:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:52:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:52:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:52:21,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693187967] [2022-07-22 21:52:21,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693187967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:52:21,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084359776] [2022-07-22 21:52:21,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 21:52:21,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:52:21,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:52:21,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:52:21,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 21:52:21,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 21:52:21,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:52:21,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-22 21:52:21,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:52:22,244 INFO L390 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 11 treesize of output 7 [2022-07-22 21:52:22,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:52:22,710 INFO L390 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 [2022-07-22 21:52:22,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:52:22,923 INFO L390 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 [2022-07-22 21:52:23,289 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 21:52:23,290 INFO L390 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 [2022-07-22 21:52:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:52:23,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:52:23,692 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse0 ~queue~0.base))) (or (not (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:23,824 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))))) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:23,928 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) |c_ULTIMATE.start_main_#t~mem14#1|) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:23,946 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))))) is different from false [2022-07-22 21:52:24,046 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))))) (or (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0)))) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:24,080 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (or (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (not (= (mod c_~ok~0 256) 0)))) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:24,094 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) is different from false [2022-07-22 21:52:24,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:24,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 72 [2022-07-22 21:52:24,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:24,177 INFO L390 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 1085 treesize of output 1055 [2022-07-22 21:52:24,212 INFO L356 Elim1Store]: treesize reduction 44, result has 54.6 percent of original size [2022-07-22 21:52:24,213 INFO L390 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1499 treesize of output 1480 [2022-07-22 21:52:24,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:24,247 INFO L390 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 1516 treesize of output 1300 [2022-07-22 21:52:24,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:24,281 INFO L390 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 1086 treesize of output 1002 [2022-07-22 21:52:29,923 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 21:52:29,923 INFO L390 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 128 treesize of output 1 [2022-07-22 21:52:29,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:29,936 INFO L390 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 68 treesize of output 88 [2022-07-22 21:52:30,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:30,023 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-07-22 21:52:30,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:52:30,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:52:30,033 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-22 21:52:30,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 138 [2022-07-22 21:52:30,048 INFO L390 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 64 treesize of output 52 [2022-07-22 21:52:30,053 INFO L390 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 52 treesize of output 46 [2022-07-22 21:52:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 21:52:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084359776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:52:31,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:52:31,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31, 29] total 87 [2022-07-22 21:52:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700946056] [2022-07-22 21:52:31,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:52:31,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-22 21:52:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:52:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-22 21:52:31,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=5786, Unknown=7, NotChecked=1134, Total=7482 [2022-07-22 21:52:31,572 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 189 [2022-07-22 21:52:31,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1484 transitions, 15820 flow. Second operand has 87 states, 87 states have (on average 59.49425287356322) internal successors, (5176), 87 states have internal predecessors, (5176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:52:31,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:52:31,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 189 [2022-07-22 21:52:31,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:53:08,532 INFO L129 PetriNetUnfolder]: 33196/62159 cut-off events. [2022-07-22 21:53:08,532 INFO L130 PetriNetUnfolder]: For 1762274/1762495 co-relation queries the response was YES. [2022-07-22 21:53:10,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 491099 conditions, 62159 events. 33196/62159 cut-off events. For 1762274/1762495 co-relation queries the response was YES. Maximal size of possible extension queue 2894. Compared 645587 event pairs, 5025 based on Foata normal form. 103/62068 useless extension candidates. Maximal degree in co-relation 490984. Up to 23364 conditions per place. [2022-07-22 21:53:10,613 INFO L132 encePairwiseOnDemand]: 121/189 looper letters, 1281 selfloop transitions, 1817 changer transitions 32/3180 dead transitions. [2022-07-22 21:53:10,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 3180 transitions, 41514 flow [2022-07-22 21:53:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-07-22 21:53:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2022-07-22 21:53:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 8079 transitions. [2022-07-22 21:53:10,623 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3238335738335738 [2022-07-22 21:53:10,623 INFO L72 ComplementDD]: Start complementDD. Operand 132 states and 8079 transitions. [2022-07-22 21:53:10,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 8079 transitions. [2022-07-22 21:53:10,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:53:10,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 132 states and 8079 transitions. [2022-07-22 21:53:10,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 133 states, 132 states have (on average 61.20454545454545) internal successors, (8079), 132 states have internal predecessors, (8079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:53:10,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 133 states, 133 states have (on average 189.0) internal successors, (25137), 133 states have internal predecessors, (25137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:53:10,655 INFO L81 ComplementDD]: Finished complementDD. Result has 133 states, 133 states have (on average 189.0) internal successors, (25137), 133 states have internal predecessors, (25137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:53:10,656 INFO L186 Difference]: Start difference. First operand has 519 places, 1484 transitions, 15820 flow. Second operand 132 states and 8079 transitions. [2022-07-22 21:53:10,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 3180 transitions, 41514 flow [2022-07-22 21:53:25,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 3180 transitions, 40454 flow, removed 493 selfloop flow, removed 32 redundant places. [2022-07-22 21:53:25,693 INFO L242 Difference]: Finished difference. Result has 665 places, 2512 transitions, 34075 flow [2022-07-22 21:53:25,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=15275, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=886, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=132, PETRI_FLOW=34075, PETRI_PLACES=665, PETRI_TRANSITIONS=2512} [2022-07-22 21:53:25,695 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 495 predicate places. [2022-07-22 21:53:25,695 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 2512 transitions, 34075 flow [2022-07-22 21:53:25,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 59.49425287356322) internal successors, (5176), 87 states have internal predecessors, (5176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:53:25,696 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:53:25,696 INFO L200 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] [2022-07-22 21:53:25,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 21:53:25,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:53:25,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:53:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:53:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash 829284030, now seen corresponding path program 5 times [2022-07-22 21:53:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:53:25,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841873350] [2022-07-22 21:53:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:53:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:53:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:53:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:53:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:53:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841873350] [2022-07-22 21:53:27,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841873350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:53:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712313834] [2022-07-22 21:53:27,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 21:53:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:53:27,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:53:27,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:53:27,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 21:53:27,511 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:53:27,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:53:27,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-22 21:53:27,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:53:28,816 INFO L390 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 11 treesize of output 7 [2022-07-22 21:53:29,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:53:29,332 INFO L390 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 [2022-07-22 21:53:29,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:53:29,577 INFO L390 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 [2022-07-22 21:53:30,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:53:30,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:53:30,105 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-22 21:53:30,105 INFO L390 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 34 treesize of output 13 [2022-07-22 21:53:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:53:30,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:53:30,550 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (and (forall ((v_ArrVal_272 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_272 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))))))))) is different from false [2022-07-22 21:53:30,688 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2022-07-22 21:53:30,782 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) |c_ULTIMATE.start_main_#t~mem14#1|))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0)))) (< c_~start~0 0)) is different from false [2022-07-22 21:53:30,823 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0)))) (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0)) is different from false [2022-07-22 21:53:30,962 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) |c_ULTIMATE.start_main_#t~ret13#1.offset|)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4)))))))))) is different from false [2022-07-22 21:53:30,996 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (not (= (mod c_~ok~0 256) 0)))) (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0)) is different from false [2022-07-22 21:53:31,017 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (not (< c_~end~0 c_~n~0)) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0)) is different from false [2022-07-22 21:53:31,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,116 INFO L390 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 56 treesize of output 45 [2022-07-22 21:53:31,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,127 INFO L390 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 854 treesize of output 746 [2022-07-22 21:53:31,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,139 INFO L390 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 726 treesize of output 647 [2022-07-22 21:53:31,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,154 INFO L390 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 630 treesize of output 455 [2022-07-22 21:53:31,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 72 [2022-07-22 21:53:31,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,348 INFO L390 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 1085 treesize of output 1055 [2022-07-22 21:53:31,388 INFO L356 Elim1Store]: treesize reduction 44, result has 54.6 percent of original size [2022-07-22 21:53:31,389 INFO L390 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1499 treesize of output 1480 [2022-07-22 21:53:31,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,425 INFO L390 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 1314 treesize of output 1230 [2022-07-22 21:53:31,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:31,456 INFO L390 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 1384 treesize of output 1168 [2022-07-22 21:53:38,132 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 21:53:38,133 INFO L390 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 558 treesize of output 1 [2022-07-22 21:53:38,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:53:38,151 INFO L390 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 68 treesize of output 88 [2022-07-22 21:53:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 21:53:40,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712313834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:53:40,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:53:40,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 29] total 91 [2022-07-22 21:53:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637850087] [2022-07-22 21:53:40,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:53:40,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-22 21:53:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:53:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-22 21:53:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=6192, Unknown=7, NotChecked=1190, Total=8190 [2022-07-22 21:53:40,083 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 189 [2022-07-22 21:53:40,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 2512 transitions, 34075 flow. Second operand has 91 states, 91 states have (on average 59.34065934065934) internal successors, (5400), 91 states have internal predecessors, (5400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:53:40,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:53:40,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 189 [2022-07-22 21:53:40,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand