/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:44:44,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:44:44,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:44:44,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:44:44,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:44:44,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:44:44,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:44:44,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:44:44,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:44:44,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:44:44,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:44:44,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:44:44,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:44:44,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:44:44,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:44:44,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:44:44,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:44:44,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:44:44,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:44:44,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:44:44,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:44:44,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:44:44,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:44:44,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:44:44,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:44:44,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:44:44,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:44:44,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:44:44,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:44:44,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:44:44,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:44:44,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:44:44,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:44:44,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:44:44,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:44:44,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:44:44,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:44:44,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:44:44,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:44:44,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:44:44,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:44:44,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:44:44,336 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:44:44,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:44:44,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:44:44,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:44:44,338 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:44:44,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:44:44,339 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:44:44,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:44:44,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:44:44,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:44:44,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:44:44,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:44:44,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:44:44,340 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:44:44,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:44:44,340 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:44:44,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:44:44,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:44:44,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:44:44,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:44:44,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:44:44,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:44:44,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:44:44,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:44:44,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:44:44,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:44:44,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:44:44,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:44:44,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:44:44,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:44:44,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:44:44,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:44:44,636 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:44:44,637 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:44:44,637 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2020-10-16 01:44:44,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a547caae8/96a7b2f02af14f918e1997d016692ed2/FLAG4e75697b2 [2020-10-16 01:44:45,226 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:44:45,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2020-10-16 01:44:45,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a547caae8/96a7b2f02af14f918e1997d016692ed2/FLAG4e75697b2 [2020-10-16 01:44:45,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a547caae8/96a7b2f02af14f918e1997d016692ed2 [2020-10-16 01:44:45,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:44:45,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:44:45,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:44:45,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:44:45,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:44:45,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:44:45" (1/1) ... [2020-10-16 01:44:45,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de51a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:45, skipping insertion in model container [2020-10-16 01:44:45,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:44:45" (1/1) ... [2020-10-16 01:44:45,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:44:45,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:44:45,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:44:46,135 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:44:46,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:44:46,293 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:44:46,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46 WrapperNode [2020-10-16 01:44:46,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:44:46,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:44:46,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:44:46,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:44:46,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:44:46,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:44:46,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:44:46,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:44:46,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2020-10-16 01:44:46,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:44:46,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:44:46,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:44:46,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:44:46,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:44:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:44:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:44:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:44:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:44:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:44:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:44:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:44:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:44:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:44:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:44:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:44:46,488 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:44:48,394 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:44:48,395 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:44:48,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:48 BoogieIcfgContainer [2020-10-16 01:44:48,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:44:48,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:44:48,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:44:48,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:44:48,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:44:45" (1/3) ... [2020-10-16 01:44:48,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1a0b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:48, skipping insertion in model container [2020-10-16 01:44:48,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (2/3) ... [2020-10-16 01:44:48,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1a0b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:48, skipping insertion in model container [2020-10-16 01:44:48,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:48" (3/3) ... [2020-10-16 01:44:48,406 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2020-10-16 01:44:48,418 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:44:48,425 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:44:48,426 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:44:48,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,456 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,459 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,459 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,466 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,467 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,467 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,476 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,476 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:48,495 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:44:48,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:44:48,516 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:44:48,517 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:44:48,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:44:48,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:44:48,517 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:44:48,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:44:48,517 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:44:48,530 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 01:44:48,565 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 01:44:48,565 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:48,569 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 01:44:48,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 01:44:48,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:48,578 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:44:48,580 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:48,583 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:48,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:48,600 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 01:44:48,600 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:48,601 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 01:44:48,603 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 01:44:48,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:48,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:48,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:48,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:48,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:48,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:48,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:48,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:48,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:48,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:48,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:48,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:48,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:48,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:48,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:48,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:48,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:49,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:49,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:49,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:49,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:49,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:49,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:49,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:49,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:49,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:49,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:49,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:49,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:49,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:49,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:49,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:44:49,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:49,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:49,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:49,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:49,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:49,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:49,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:49,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:49,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:49,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:49,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:49,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:49,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:49,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,924 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:44:50,028 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:44:50,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:50,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:44:50,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:50,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:50,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:51,261 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 01:44:51,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:44:51,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:51,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:51,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,063 WARN L193 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 01:44:52,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:44:52,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:52,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:52,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:52,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:53,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:53,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:53,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:53,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:53,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,629 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 01:44:53,953 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 01:44:54,572 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 01:44:54,869 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 01:44:55,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:44:55,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,063 WARN L193 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2020-10-16 01:44:56,399 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 01:44:56,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:56,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:56,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:56,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:56,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:56,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:56,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:56,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:56,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:56,898 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 01:44:57,002 INFO L132 LiptonReduction]: Checked pairs total: 2125 [2020-10-16 01:44:57,002 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 01:44:57,005 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8429 [2020-10-16 01:44:57,011 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 01:44:57,011 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:57,011 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:44:57,013 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash 895506, now seen corresponding path program 1 times [2020-10-16 01:44:57,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689610253] [2020-10-16 01:44:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:57,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689610253] [2020-10-16 01:44:57,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:44:57,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748480998] [2020-10-16 01:44:57,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:57,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:57,274 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2020-10-16 01:44:57,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states. [2020-10-16 01:44:57,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2020-10-16 01:44:57,283 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,366 INFO L129 PetriNetUnfolder]: 23/59 cut-off events. [2020-10-16 01:44:57,366 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:57,367 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 59 events. 23/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 194 event pairs, 16 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 37 conditions per place. [2020-10-16 01:44:57,369 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 7 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 01:44:57,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 68 flow [2020-10-16 01:44:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2020-10-16 01:44:57,387 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7928571428571428 [2020-10-16 01:44:57,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2020-10-16 01:44:57,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2020-10-16 01:44:57,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2020-10-16 01:44:57,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:57,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:57,404 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:57,407 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 333 transitions. [2020-10-16 01:44:57,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 68 flow [2020-10-16 01:44:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:57,413 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2020-10-16 01:44:57,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 01:44:57,417 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:44:57,417 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2020-10-16 01:44:57,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:57,417 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,417 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:44:57,418 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1851001785, now seen corresponding path program 1 times [2020-10-16 01:44:57,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255491498] [2020-10-16 01:44:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:57,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255491498] [2020-10-16 01:44:57,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:44:57,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83119896] [2020-10-16 01:44:57,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:57,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:57,547 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 140 [2020-10-16 01:44:57,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states. [2020-10-16 01:44:57,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 140 [2020-10-16 01:44:57,548 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,598 INFO L129 PetriNetUnfolder]: 38/91 cut-off events. [2020-10-16 01:44:57,598 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 01:44:57,599 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 91 events. 38/91 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 30 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 171. Up to 72 conditions per place. [2020-10-16 01:44:57,600 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 8 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2020-10-16 01:44:57,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 18 transitions, 68 flow [2020-10-16 01:44:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2020-10-16 01:44:57,604 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7357142857142858 [2020-10-16 01:44:57,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2020-10-16 01:44:57,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2020-10-16 01:44:57,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2020-10-16 01:44:57,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:57,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:57,607 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:57,607 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 309 transitions. [2020-10-16 01:44:57,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 18 transitions, 68 flow [2020-10-16 01:44:57,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 18 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:57,609 INFO L241 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2020-10-16 01:44:57,609 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2020-10-16 01:44:57,610 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:44:57,610 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2020-10-16 01:44:57,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:57,610 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,610 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:44:57,611 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1546524851, now seen corresponding path program 1 times [2020-10-16 01:44:57,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135132144] [2020-10-16 01:44:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:57,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135132144] [2020-10-16 01:44:57,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:44:57,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810857655] [2020-10-16 01:44:57,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:57,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:57,690 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2020-10-16 01:44:57,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states. [2020-10-16 01:44:57,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2020-10-16 01:44:57,691 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,709 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2020-10-16 01:44:57,709 INFO L130 PetriNetUnfolder]: For 7/16 co-relation queries the response was YES. [2020-10-16 01:44:57,710 INFO L80 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 34 events. 5/34 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 1 based on Foata normal form. 2/34 useless extension candidates. Maximal degree in co-relation 58. Up to 12 conditions per place. [2020-10-16 01:44:57,710 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 3 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2020-10-16 01:44:57,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 73 flow [2020-10-16 01:44:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2020-10-16 01:44:57,713 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.830952380952381 [2020-10-16 01:44:57,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2020-10-16 01:44:57,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2020-10-16 01:44:57,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2020-10-16 01:44:57,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:57,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:57,716 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:57,716 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 349 transitions. [2020-10-16 01:44:57,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 73 flow [2020-10-16 01:44:57,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 19 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:57,717 INFO L241 Difference]: Finished difference. Result has 25 places, 19 transitions, 74 flow [2020-10-16 01:44:57,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2020-10-16 01:44:57,718 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2020-10-16 01:44:57,718 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 74 flow [2020-10-16 01:44:57,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:57,718 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,718 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:44:57,719 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1547292690, now seen corresponding path program 1 times [2020-10-16 01:44:57,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115426630] [2020-10-16 01:44:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:57,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115426630] [2020-10-16 01:44:57,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:44:57,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930322507] [2020-10-16 01:44:57,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:44:57,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:44:57,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:44:57,801 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2020-10-16 01:44:57,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 74 flow. Second operand 4 states. [2020-10-16 01:44:57,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2020-10-16 01:44:57,802 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,861 INFO L129 PetriNetUnfolder]: 42/102 cut-off events. [2020-10-16 01:44:57,861 INFO L130 PetriNetUnfolder]: For 50/58 co-relation queries the response was YES. [2020-10-16 01:44:57,862 INFO L80 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 102 events. 42/102 cut-off events. For 50/58 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 366 event pairs, 24 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 235. Up to 72 conditions per place. [2020-10-16 01:44:57,863 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2020-10-16 01:44:57,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 104 flow [2020-10-16 01:44:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2020-10-16 01:44:57,866 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7119047619047619 [2020-10-16 01:44:57,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2020-10-16 01:44:57,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2020-10-16 01:44:57,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2020-10-16 01:44:57,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:57,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:57,868 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:57,869 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 74 flow. Second operand 3 states and 299 transitions. [2020-10-16 01:44:57,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 104 flow [2020-10-16 01:44:57,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:57,870 INFO L241 Difference]: Finished difference. Result has 27 places, 21 transitions, 94 flow [2020-10-16 01:44:57,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2020-10-16 01:44:57,871 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2020-10-16 01:44:57,871 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 94 flow [2020-10-16 01:44:57,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:44:57,871 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:44:57,872 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -696265198, now seen corresponding path program 1 times [2020-10-16 01:44:57,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552449465] [2020-10-16 01:44:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:58,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552449465] [2020-10-16 01:44:58,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:58,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810261153] [2020-10-16 01:44:58,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:58,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:58,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:58,013 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 140 [2020-10-16 01:44:58,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 94 flow. Second operand 5 states. [2020-10-16 01:44:58,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 140 [2020-10-16 01:44:58,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,107 INFO L129 PetriNetUnfolder]: 35/89 cut-off events. [2020-10-16 01:44:58,107 INFO L130 PetriNetUnfolder]: For 99/107 co-relation queries the response was YES. [2020-10-16 01:44:58,108 INFO L80 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 89 events. 35/89 cut-off events. For 99/107 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 302 event pairs, 11 based on Foata normal form. 3/90 useless extension candidates. Maximal degree in co-relation 236. Up to 59 conditions per place. [2020-10-16 01:44:58,109 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 8 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2020-10-16 01:44:58,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 132 flow [2020-10-16 01:44:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:44:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:44:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2020-10-16 01:44:58,112 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6892857142857143 [2020-10-16 01:44:58,112 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2020-10-16 01:44:58,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2020-10-16 01:44:58,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2020-10-16 01:44:58,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:44:58,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:44:58,115 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:44:58,115 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 94 flow. Second operand 4 states and 386 transitions. [2020-10-16 01:44:58,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 132 flow [2020-10-16 01:44:58,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:58,117 INFO L241 Difference]: Finished difference. Result has 30 places, 23 transitions, 118 flow [2020-10-16 01:44:58,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2020-10-16 01:44:58,118 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2020-10-16 01:44:58,118 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 118 flow [2020-10-16 01:44:58,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:58,118 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,118 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:44:58,119 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -723049694, now seen corresponding path program 1 times [2020-10-16 01:44:58,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211620268] [2020-10-16 01:44:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:58,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211620268] [2020-10-16 01:44:58,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:58,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380854712] [2020-10-16 01:44:58,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:58,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:58,207 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 01:44:58,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 118 flow. Second operand 5 states. [2020-10-16 01:44:58,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 01:44:58,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,272 INFO L129 PetriNetUnfolder]: 32/85 cut-off events. [2020-10-16 01:44:58,273 INFO L130 PetriNetUnfolder]: For 160/165 co-relation queries the response was YES. [2020-10-16 01:44:58,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 85 events. 32/85 cut-off events. For 160/165 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 296 event pairs, 6 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 246. Up to 50 conditions per place. [2020-10-16 01:44:58,274 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 9 selfloop transitions, 8 changer transitions 0/28 dead transitions. [2020-10-16 01:44:58,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 166 flow [2020-10-16 01:44:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:44:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:44:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2020-10-16 01:44:58,277 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7410714285714286 [2020-10-16 01:44:58,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2020-10-16 01:44:58,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2020-10-16 01:44:58,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2020-10-16 01:44:58,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:44:58,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:44:58,280 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:44:58,281 INFO L185 Difference]: Start difference. First operand has 30 places, 23 transitions, 118 flow. Second operand 4 states and 415 transitions. [2020-10-16 01:44:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 166 flow [2020-10-16 01:44:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:58,283 INFO L241 Difference]: Finished difference. Result has 33 places, 26 transitions, 153 flow [2020-10-16 01:44:58,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2020-10-16 01:44:58,284 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2020-10-16 01:44:58,284 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 153 flow [2020-10-16 01:44:58,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:58,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,284 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:44:58,285 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash -109735798, now seen corresponding path program 1 times [2020-10-16 01:44:58,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119731607] [2020-10-16 01:44:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:58,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119731607] [2020-10-16 01:44:58,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:44:58,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434446180] [2020-10-16 01:44:58,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:58,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:58,330 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2020-10-16 01:44:58,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 153 flow. Second operand 3 states. [2020-10-16 01:44:58,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2020-10-16 01:44:58,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,355 INFO L129 PetriNetUnfolder]: 21/78 cut-off events. [2020-10-16 01:44:58,355 INFO L130 PetriNetUnfolder]: For 384/417 co-relation queries the response was YES. [2020-10-16 01:44:58,356 INFO L80 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 78 events. 21/78 cut-off events. For 384/417 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 296 event pairs, 9 based on Foata normal form. 12/86 useless extension candidates. Maximal degree in co-relation 231. Up to 33 conditions per place. [2020-10-16 01:44:58,356 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 4 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2020-10-16 01:44:58,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 167 flow [2020-10-16 01:44:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2020-10-16 01:44:58,359 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2020-10-16 01:44:58,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2020-10-16 01:44:58,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2020-10-16 01:44:58,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2020-10-16 01:44:58,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:58,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:58,361 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:58,362 INFO L185 Difference]: Start difference. First operand has 33 places, 26 transitions, 153 flow. Second operand 3 states and 348 transitions. [2020-10-16 01:44:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 167 flow [2020-10-16 01:44:58,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 158 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:58,365 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 155 flow [2020-10-16 01:44:58,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2020-10-16 01:44:58,365 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2020-10-16 01:44:58,365 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 155 flow [2020-10-16 01:44:58,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:58,366 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,366 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:44:58,366 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -889626978, now seen corresponding path program 1 times [2020-10-16 01:44:58,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890115995] [2020-10-16 01:44:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:58,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890115995] [2020-10-16 01:44:58,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:58,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568717017] [2020-10-16 01:44:58,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:58,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:58,476 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 01:44:58,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 155 flow. Second operand 5 states. [2020-10-16 01:44:58,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 01:44:58,477 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,599 INFO L129 PetriNetUnfolder]: 45/127 cut-off events. [2020-10-16 01:44:58,599 INFO L130 PetriNetUnfolder]: For 327/335 co-relation queries the response was YES. [2020-10-16 01:44:58,600 INFO L80 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 127 events. 45/127 cut-off events. For 327/335 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 540 event pairs, 9 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 429. Up to 78 conditions per place. [2020-10-16 01:44:58,602 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 9 selfloop transitions, 12 changer transitions 1/33 dead transitions. [2020-10-16 01:44:58,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 239 flow [2020-10-16 01:44:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2020-10-16 01:44:58,605 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7371428571428571 [2020-10-16 01:44:58,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2020-10-16 01:44:58,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2020-10-16 01:44:58,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2020-10-16 01:44:58,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:58,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:58,609 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:58,609 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 155 flow. Second operand 5 states and 516 transitions. [2020-10-16 01:44:58,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 239 flow [2020-10-16 01:44:58,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 232 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:58,615 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 228 flow [2020-10-16 01:44:58,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2020-10-16 01:44:58,616 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 16 predicate places. [2020-10-16 01:44:58,616 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 228 flow [2020-10-16 01:44:58,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:58,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,616 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:44:58,617 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,617 INFO L82 PathProgramCache]: Analyzing trace with hash 618454284, now seen corresponding path program 2 times [2020-10-16 01:44:58,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182332985] [2020-10-16 01:44:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:58,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182332985] [2020-10-16 01:44:58,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:44:58,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299073087] [2020-10-16 01:44:58,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:44:58,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:44:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:44:58,785 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 140 [2020-10-16 01:44:58,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 228 flow. Second operand 6 states. [2020-10-16 01:44:58,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 140 [2020-10-16 01:44:58,786 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,883 INFO L129 PetriNetUnfolder]: 36/117 cut-off events. [2020-10-16 01:44:58,883 INFO L130 PetriNetUnfolder]: For 479/494 co-relation queries the response was YES. [2020-10-16 01:44:58,884 INFO L80 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 117 events. 36/117 cut-off events. For 479/494 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 540 event pairs, 11 based on Foata normal form. 14/129 useless extension candidates. Maximal degree in co-relation 468. Up to 62 conditions per place. [2020-10-16 01:44:58,885 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 13 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2020-10-16 01:44:58,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 283 flow [2020-10-16 01:44:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:44:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:44:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2020-10-16 01:44:58,887 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7 [2020-10-16 01:44:58,888 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 392 transitions. [2020-10-16 01:44:58,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 392 transitions. [2020-10-16 01:44:58,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 392 transitions. [2020-10-16 01:44:58,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:44:58,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:44:58,890 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:44:58,890 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 228 flow. Second operand 4 states and 392 transitions. [2020-10-16 01:44:58,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 283 flow [2020-10-16 01:44:58,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 280 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:58,894 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 255 flow [2020-10-16 01:44:58,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2020-10-16 01:44:58,894 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2020-10-16 01:44:58,894 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 255 flow [2020-10-16 01:44:58,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:44:58,895 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,895 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:44:58,895 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash 893187935, now seen corresponding path program 1 times [2020-10-16 01:44:58,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933055029] [2020-10-16 01:44:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:59,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933055029] [2020-10-16 01:44:59,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:59,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:59,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291996876] [2020-10-16 01:44:59,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:44:59,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:59,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:44:59,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:44:59,047 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 140 [2020-10-16 01:44:59,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 255 flow. Second operand 4 states. [2020-10-16 01:44:59,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:59,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 140 [2020-10-16 01:44:59,048 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:59,169 INFO L129 PetriNetUnfolder]: 139/276 cut-off events. [2020-10-16 01:44:59,170 INFO L130 PetriNetUnfolder]: For 1198/1217 co-relation queries the response was YES. [2020-10-16 01:44:59,171 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 276 events. 139/276 cut-off events. For 1198/1217 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1184 event pairs, 83 based on Foata normal form. 6/275 useless extension candidates. Maximal degree in co-relation 1200. Up to 259 conditions per place. [2020-10-16 01:44:59,173 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 22 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2020-10-16 01:44:59,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 385 flow [2020-10-16 01:44:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2020-10-16 01:44:59,176 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2020-10-16 01:44:59,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 435 transitions. [2020-10-16 01:44:59,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 435 transitions. [2020-10-16 01:44:59,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:59,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 435 transitions. [2020-10-16 01:44:59,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:59,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:59,179 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:59,179 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 255 flow. Second operand 5 states and 435 transitions. [2020-10-16 01:44:59,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 385 flow [2020-10-16 01:44:59,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 366 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:59,185 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 333 flow [2020-10-16 01:44:59,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2020-10-16 01:44:59,185 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 24 predicate places. [2020-10-16 01:44:59,185 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 333 flow [2020-10-16 01:44:59,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:44:59,185 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:59,186 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:59,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:44:59,186 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -867193243, now seen corresponding path program 2 times [2020-10-16 01:44:59,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:59,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503409801] [2020-10-16 01:44:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:59,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503409801] [2020-10-16 01:44:59,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:59,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:59,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692879242] [2020-10-16 01:44:59,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:44:59,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:44:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:44:59,282 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2020-10-16 01:44:59,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 333 flow. Second operand 4 states. [2020-10-16 01:44:59,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:59,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2020-10-16 01:44:59,283 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:59,353 INFO L129 PetriNetUnfolder]: 40/142 cut-off events. [2020-10-16 01:44:59,354 INFO L130 PetriNetUnfolder]: For 722/749 co-relation queries the response was YES. [2020-10-16 01:44:59,355 INFO L80 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 142 events. 40/142 cut-off events. For 722/749 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 705 event pairs, 7 based on Foata normal form. 50/190 useless extension candidates. Maximal degree in co-relation 559. Up to 49 conditions per place. [2020-10-16 01:44:59,356 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 5 selfloop transitions, 7 changer transitions 6/43 dead transitions. [2020-10-16 01:44:59,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 358 flow [2020-10-16 01:44:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2020-10-16 01:44:59,360 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8057142857142857 [2020-10-16 01:44:59,360 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2020-10-16 01:44:59,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2020-10-16 01:44:59,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:59,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2020-10-16 01:44:59,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:59,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:59,365 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:59,365 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 333 flow. Second operand 5 states and 564 transitions. [2020-10-16 01:44:59,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 358 flow [2020-10-16 01:44:59,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 334 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:44:59,371 INFO L241 Difference]: Finished difference. Result has 52 places, 37 transitions, 299 flow [2020-10-16 01:44:59,372 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2020-10-16 01:44:59,372 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 28 predicate places. [2020-10-16 01:44:59,372 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 299 flow [2020-10-16 01:44:59,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:44:59,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:59,372 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:59,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:44:59,373 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1835042812, now seen corresponding path program 1 times [2020-10-16 01:44:59,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:59,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486606982] [2020-10-16 01:44:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:59,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486606982] [2020-10-16 01:44:59,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:59,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:44:59,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023293763] [2020-10-16 01:44:59,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:59,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:59,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:59,513 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2020-10-16 01:44:59,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 299 flow. Second operand 5 states. [2020-10-16 01:44:59,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:59,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2020-10-16 01:44:59,515 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:59,579 INFO L129 PetriNetUnfolder]: 12/77 cut-off events. [2020-10-16 01:44:59,579 INFO L130 PetriNetUnfolder]: For 585/665 co-relation queries the response was YES. [2020-10-16 01:44:59,580 INFO L80 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 77 events. 12/77 cut-off events. For 585/665 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 338 event pairs, 0 based on Foata normal form. 71/148 useless extension candidates. Maximal degree in co-relation 313. Up to 24 conditions per place. [2020-10-16 01:44:59,580 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 2 selfloop transitions, 10 changer transitions 11/38 dead transitions. [2020-10-16 01:44:59,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 322 flow [2020-10-16 01:44:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:44:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:44:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2020-10-16 01:44:59,584 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8010204081632653 [2020-10-16 01:44:59,584 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2020-10-16 01:44:59,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2020-10-16 01:44:59,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:59,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2020-10-16 01:44:59,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:44:59,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:44:59,589 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:44:59,589 INFO L185 Difference]: Start difference. First operand has 52 places, 37 transitions, 299 flow. Second operand 7 states and 785 transitions. [2020-10-16 01:44:59,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 322 flow [2020-10-16 01:44:59,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 38 transitions, 280 flow, removed 13 selfloop flow, removed 3 redundant places. [2020-10-16 01:44:59,592 INFO L241 Difference]: Finished difference. Result has 57 places, 27 transitions, 210 flow [2020-10-16 01:44:59,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2020-10-16 01:44:59,593 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 33 predicate places. [2020-10-16 01:44:59,593 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 210 flow [2020-10-16 01:44:59,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:59,593 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:59,593 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:59,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:44:59,594 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash 343065242, now seen corresponding path program 1 times [2020-10-16 01:44:59,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:59,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685591313] [2020-10-16 01:44:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:59,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685591313] [2020-10-16 01:44:59,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:59,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:44:59,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738167310] [2020-10-16 01:44:59,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:44:59,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:44:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:44:59,826 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 140 [2020-10-16 01:44:59,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 210 flow. Second operand 8 states. [2020-10-16 01:44:59,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:59,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 140 [2020-10-16 01:44:59,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:59,975 INFO L129 PetriNetUnfolder]: 4/50 cut-off events. [2020-10-16 01:44:59,975 INFO L130 PetriNetUnfolder]: For 278/288 co-relation queries the response was YES. [2020-10-16 01:44:59,975 INFO L80 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 50 events. 4/50 cut-off events. For 278/288 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 166 event pairs, 0 based on Foata normal form. 8/58 useless extension candidates. Maximal degree in co-relation 208. Up to 18 conditions per place. [2020-10-16 01:44:59,976 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 7 selfloop transitions, 4 changer transitions 10/31 dead transitions. [2020-10-16 01:44:59,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 31 transitions, 286 flow [2020-10-16 01:44:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:44:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:44:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2020-10-16 01:44:59,979 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2020-10-16 01:44:59,979 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 543 transitions. [2020-10-16 01:44:59,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 543 transitions. [2020-10-16 01:44:59,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:59,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 543 transitions. [2020-10-16 01:44:59,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:44:59,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:44:59,983 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:44:59,983 INFO L185 Difference]: Start difference. First operand has 57 places, 27 transitions, 210 flow. Second operand 6 states and 543 transitions. [2020-10-16 01:44:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 31 transitions, 286 flow [2020-10-16 01:44:59,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 215 flow, removed 18 selfloop flow, removed 14 redundant places. [2020-10-16 01:44:59,985 INFO L241 Difference]: Finished difference. Result has 46 places, 19 transitions, 111 flow [2020-10-16 01:44:59,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=19} [2020-10-16 01:44:59,986 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 22 predicate places. [2020-10-16 01:44:59,986 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 19 transitions, 111 flow [2020-10-16 01:44:59,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:44:59,986 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:59,986 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:59,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:44:59,986 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash -348381136, now seen corresponding path program 2 times [2020-10-16 01:44:59,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:59,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682218424] [2020-10-16 01:44:59,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:45:00,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:45:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:45:00,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:45:00,106 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:45:00,106 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:45:00,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:45:00,107 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:45:00,116 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L786-->L793: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In-1110109380 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-1110109380 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1110109380 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1110109380 256) 0))) (let ((.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse4 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 .cse1 (= ~y$w_buff0~0_In-1110109380 ~y~0_Out-1110109380)) (and (or (and .cse2 (= ~y$w_buff1~0_In-1110109380 ~y~0_Out-1110109380) .cse3) (and .cse4 (= ~y~0_Out-1110109380 ~y~0_In-1110109380))) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1110109380 0)) (or (and (= ~y$w_buff1_used~0_Out-1110109380 0) .cse2 .cse3) (and (= ~y$w_buff1_used~0_In-1110109380 ~y$w_buff1_used~0_Out-1110109380) .cse4)) (= ~y$r_buff0_thd0~0_In-1110109380 ~y$r_buff0_thd0~0_Out-1110109380) (= ~y$r_buff1_thd0~0_Out-1110109380 ~y$r_buff1_thd0~0_In-1110109380) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1110109380 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1110109380|) (or (and (= ~y$w_buff0_used~0_Out-1110109380 ~y$w_buff0_used~0_In-1110109380) .cse5) (and .cse0 (= ~y$w_buff0_used~0_Out-1110109380 0) .cse1))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1110109380|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110109380, ~y$w_buff1~0=~y$w_buff1~0_In-1110109380, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1110109380, ~y$w_buff0~0=~y$w_buff0~0_In-1110109380, ~y~0=~y~0_In-1110109380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1110109380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110109380} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1110109380, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1110109380|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1110109380|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1110109380|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1110109380|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1110109380|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1110109380|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1110109380|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1110109380, ~y$w_buff1~0=~y$w_buff1~0_In-1110109380, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1110109380, ~y$w_buff0~0=~y$w_buff0~0_In-1110109380, ~y~0=~y~0_Out-1110109380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1110109380, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1110109380} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 01:45:00,121 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,127 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,127 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,130 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,131 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,131 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,132 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,132 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,132 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,134 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,134 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,135 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,135 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:00,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:00,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:45:00 BasicIcfg [2020-10-16 01:45:00,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:45:00,219 INFO L168 Benchmark]: Toolchain (without parser) took 14670.09 ms. Allocated memory was 250.1 MB in the beginning and 563.6 MB in the end (delta: 313.5 MB). Free memory was 205.2 MB in the beginning and 239.8 MB in the end (delta: -34.7 MB). Peak memory consumption was 278.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:00,220 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:45:00,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.72 ms. Allocated memory was 250.1 MB in the beginning and 363.3 MB in the end (delta: 113.2 MB). Free memory was 205.2 MB in the beginning and 323.7 MB in the end (delta: -118.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:00,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.23 ms. Allocated memory is still 363.3 MB. Free memory was 323.7 MB in the beginning and 319.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:00,222 INFO L168 Benchmark]: Boogie Preprocessor took 52.64 ms. Allocated memory is still 363.3 MB. Free memory is still 319.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:45:00,222 INFO L168 Benchmark]: RCFGBuilder took 1981.15 ms. Allocated memory is still 363.3 MB. Free memory was 319.9 MB in the beginning and 287.4 MB in the end (delta: 32.6 MB). Peak memory consumption was 166.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:00,223 INFO L168 Benchmark]: TraceAbstraction took 11818.98 ms. Allocated memory was 363.3 MB in the beginning and 563.6 MB in the end (delta: 200.3 MB). Free memory was 287.4 MB in the beginning and 239.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 247.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:00,227 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 743.72 ms. Allocated memory was 250.1 MB in the beginning and 363.3 MB in the end (delta: 113.2 MB). Free memory was 205.2 MB in the beginning and 323.7 MB in the end (delta: -118.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 66.23 ms. Allocated memory is still 363.3 MB. Free memory was 323.7 MB in the beginning and 319.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 52.64 ms. Allocated memory is still 363.3 MB. Free memory is still 319.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1981.15 ms. Allocated memory is still 363.3 MB. Free memory was 319.9 MB in the beginning and 287.4 MB in the end (delta: 32.6 MB). Peak memory consumption was 166.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11818.98 ms. Allocated memory was 363.3 MB in the beginning and 563.6 MB in the end (delta: 200.3 MB). Free memory was 287.4 MB in the beginning and 239.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 247.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 582 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 77 PlacesBefore, 24 PlacesAfterwards, 72 TransitionsBefore, 17 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2125 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L703] 0 int y = 0; [L704] 0 _Bool y$flush_delayed; [L705] 0 int y$mem_tmp; [L706] 0 _Bool y$r_buff0_thd0; [L707] 0 _Bool y$r_buff0_thd1; [L708] 0 _Bool y$r_buff0_thd2; [L709] 0 _Bool y$r_buff1_thd0; [L710] 0 _Bool y$r_buff1_thd1; [L711] 0 _Bool y$r_buff1_thd2; [L712] 0 _Bool y$read_delayed; [L713] 0 int *y$read_delayed_var; [L714] 0 int y$w_buff0; [L715] 0 _Bool y$w_buff0_used; [L716] 0 int y$w_buff1; [L717] 0 _Bool y$w_buff1_used; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2477; [L780] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 1 y$w_buff1 = y$w_buff0 [L724] 1 y$w_buff0 = 2 [L725] 1 y$w_buff1_used = y$w_buff0_used [L726] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L728] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 pthread_t t2478; [L782] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 y$flush_delayed = weak$$choice2 [L798] 0 y$mem_tmp = y [L799] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L800] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L807] 0 y = y$flush_delayed ? y$mem_tmp : y [L808] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 59 SDtfs, 18 SDslu, 13 SDs, 0 SdLazy, 227 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 9721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...