/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 21:05:41,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 21:05:41,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 21:05:41,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 21:05:41,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 21:05:41,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 21:05:41,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 21:05:41,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 21:05:41,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 21:05:41,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 21:05:41,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 21:05:41,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 21:05:41,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 21:05:41,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 21:05:41,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 21:05:41,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 21:05:41,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 21:05:41,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 21:05:41,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 21:05:41,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 21:05:41,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 21:05:41,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 21:05:41,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 21:05:41,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 21:05:41,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 21:05:41,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 21:05:41,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 21:05:41,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 21:05:41,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 21:05:41,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 21:05:41,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 21:05:41,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 21:05:41,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 21:05:41,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 21:05:41,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 21:05:41,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 21:05:41,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 21:05:41,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 21:05:41,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 21:05:41,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 21:05:41,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 21:05:41,756 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-NoLbe.epf [2021-08-12 21:05:41,792 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 21:05:41,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 21:05:41,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 21:05:41,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 21:05:41,796 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 21:05:41,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 21:05:41,796 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 21:05:41,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 21:05:41,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 21:05:41,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 21:05:41,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 21:05:41,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 21:05:41,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 21:05:41,798 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 21:05:41,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 21:05:41,798 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 21:05:41,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 21:05:41,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 21:05:41,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 21:05:41,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 21:05:41,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 21:05:41,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 21:05:41,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 21:05:41,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 21:05:41,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 21:05:41,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 21:05:41,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 21:05:41,800 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 21:05:41,800 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 21:05:41,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 21:05:41,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-12 21:05:42,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 21:05:42,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 21:05:42,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 21:05:42,116 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 21:05:42,116 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 21:05:42,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2021-08-12 21:05:42,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b4592f3/061f0fc40a5b4b3abd026c7c47e2cc7d/FLAGb662bdafd [2021-08-12 21:05:42,712 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 21:05:42,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2021-08-12 21:05:42,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b4592f3/061f0fc40a5b4b3abd026c7c47e2cc7d/FLAGb662bdafd [2021-08-12 21:05:43,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b4592f3/061f0fc40a5b4b3abd026c7c47e2cc7d [2021-08-12 21:05:43,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 21:05:43,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 21:05:43,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 21:05:43,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 21:05:43,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 21:05:43,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a26d957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43, skipping insertion in model container [2021-08-12 21:05:43,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 21:05:43,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 21:05:43,432 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i[950,963] [2021-08-12 21:05:43,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 21:05:43,633 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 21:05:43,647 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i[950,963] [2021-08-12 21:05:43,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 21:05:43,771 INFO L208 MainTranslator]: Completed translation [2021-08-12 21:05:43,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43 WrapperNode [2021-08-12 21:05:43,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 21:05:43,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 21:05:43,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 21:05:43,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 21:05:43,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 21:05:43,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 21:05:43,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 21:05:43,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 21:05:43,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (1/1) ... [2021-08-12 21:05:43,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 21:05:43,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 21:05:43,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 21:05:43,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 21:05:43,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (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 [2021-08-12 21:05:43,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 21:05:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 21:05:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 21:05:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 21:05:43,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 21:05:43,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 21:05:43,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 21:05:43,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 21:05:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 21:05:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 21:05:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 21:05:43,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 21:05:43,970 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 21:05:45,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 21:05:45,463 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 21:05:45,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:05:45 BoogieIcfgContainer [2021-08-12 21:05:45,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 21:05:45,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 21:05:45,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 21:05:45,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 21:05:45,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 09:05:43" (1/3) ... [2021-08-12 21:05:45,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2721774b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:05:45, skipping insertion in model container [2021-08-12 21:05:45,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:43" (2/3) ... [2021-08-12 21:05:45,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2721774b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:05:45, skipping insertion in model container [2021-08-12 21:05:45,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:05:45" (3/3) ... [2021-08-12 21:05:45,472 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2021-08-12 21:05:45,478 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 21:05:45,478 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 21:05:45,479 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 21:05:45,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,525 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,525 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,530 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,530 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:45,532 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 21:05:45,553 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-12 21:05:45,578 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 21:05:45,578 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 21:05:45,579 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 21:05:45,579 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 21:05:45,579 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 21:05:45,579 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 21:05:45,579 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 21:05:45,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 21:05:45,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2021-08-12 21:05:45,617 INFO L129 PetriNetUnfolder]: 2/84 cut-off events. [2021-08-12 21:05:45,618 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:45,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-12 21:05:45,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2021-08-12 21:05:45,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2021-08-12 21:05:45,631 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-08-12 21:05:45,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:45,632 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:45,632 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:45,633 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash -23040913, now seen corresponding path program 1 times [2021-08-12 21:05:45,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:45,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125770807] [2021-08-12 21:05:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:45,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:45,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:45,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:45,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:45,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:45,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125770807] [2021-08-12 21:05:45,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125770807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:45,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:45,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 21:05:45,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125885378] [2021-08-12 21:05:45,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 21:05:45,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:45,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 21:05:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 21:05:45,901 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 86 [2021-08-12 21:05:45,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:45,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:45,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 86 [2021-08-12 21:05:45,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:45,963 INFO L129 PetriNetUnfolder]: 16/144 cut-off events. [2021-08-12 21:05:45,963 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:45,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 144 events. 16/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 2 based on Foata normal form. 7/144 useless extension candidates. Maximal degree in co-relation 143. Up to 27 conditions per place. [2021-08-12 21:05:45,965 INFO L132 encePairwiseOnDemand]: 81/86 looper letters, 7 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2021-08-12 21:05:45,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 190 flow [2021-08-12 21:05:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 21:05:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 21:05:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2021-08-12 21:05:45,976 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2021-08-12 21:05:45,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2021-08-12 21:05:45,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2021-08-12 21:05:45,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:45,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2021-08-12 21:05:45,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:45,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:45,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:45,987 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2021-08-12 21:05:45,987 INFO L482 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 190 flow [2021-08-12 21:05:45,987 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:45,987 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:45,988 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:45,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 21:05:45,988 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:45,988 INFO L82 PathProgramCache]: Analyzing trace with hash -580539508, now seen corresponding path program 1 times [2021-08-12 21:05:45,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:45,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255572421] [2021-08-12 21:05:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:46,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:46,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:46,182 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:46,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:46,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:46,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:46,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:46,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:46,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255572421] [2021-08-12 21:05:46,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255572421] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:46,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:46,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:46,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703231144] [2021-08-12 21:05:46,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:46,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:46,217 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 86 [2021-08-12 21:05:46,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:46,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 86 [2021-08-12 21:05:46,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:46,338 INFO L129 PetriNetUnfolder]: 24/201 cut-off events. [2021-08-12 21:05:46,338 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-08-12 21:05:46,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 201 events. 24/201 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 749 event pairs, 6 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 243. Up to 35 conditions per place. [2021-08-12 21:05:46,340 INFO L132 encePairwiseOnDemand]: 80/86 looper letters, 8 selfloop transitions, 2 changer transitions 13/96 dead transitions. [2021-08-12 21:05:46,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 266 flow [2021-08-12 21:05:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 21:05:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 21:05:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 689 transitions. [2021-08-12 21:05:46,345 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8901808785529716 [2021-08-12 21:05:46,345 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 689 transitions. [2021-08-12 21:05:46,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 689 transitions. [2021-08-12 21:05:46,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:46,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 689 transitions. [2021-08-12 21:05:46,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.55555555555556) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,352 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,353 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 8 predicate places. [2021-08-12 21:05:46,353 INFO L482 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 266 flow [2021-08-12 21:05:46,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,353 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:46,353 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:46,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 21:05:46,354 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:46,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1979180659, now seen corresponding path program 1 times [2021-08-12 21:05:46,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:46,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698743051] [2021-08-12 21:05:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:46,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:46,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:46,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:46,497 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:46,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:46,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:46,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:46,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:46,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:46,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698743051] [2021-08-12 21:05:46,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698743051] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:46,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:46,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 21:05:46,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128589526] [2021-08-12 21:05:46,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 21:05:46,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 21:05:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 21:05:46,551 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 86 [2021-08-12 21:05:46,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:46,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 86 [2021-08-12 21:05:46,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:46,816 INFO L129 PetriNetUnfolder]: 59/424 cut-off events. [2021-08-12 21:05:46,816 INFO L130 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2021-08-12 21:05:46,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 424 events. 59/424 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2598 event pairs, 19 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 679. Up to 68 conditions per place. [2021-08-12 21:05:46,821 INFO L132 encePairwiseOnDemand]: 78/86 looper letters, 8 selfloop transitions, 4 changer transitions 44/126 dead transitions. [2021-08-12 21:05:46,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 126 transitions, 496 flow [2021-08-12 21:05:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 21:05:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 21:05:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 973 transitions. [2021-08-12 21:05:46,824 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.870304114490161 [2021-08-12 21:05:46,824 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 973 transitions. [2021-08-12 21:05:46,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 973 transitions. [2021-08-12 21:05:46,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:46,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 973 transitions. [2021-08-12 21:05:46,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.84615384615384) internal successors, (973), 13 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,831 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,831 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2021-08-12 21:05:46,831 INFO L482 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 496 flow [2021-08-12 21:05:46,831 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:46,832 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:46,832 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:46,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 21:05:46,832 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2011144508, now seen corresponding path program 1 times [2021-08-12 21:05:46,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:46,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656511931] [2021-08-12 21:05:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:46,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:46,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:46,987 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-08-12 21:05:46,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:46,989 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-08-12 21:05:46,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:46,995 INFO L142 QuantifierPusher]: treesize reduction 4, result has 71.4 percent of original size [2021-08-12 21:05:46,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:05:47,008 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-08-12 21:05:47,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 21:05:47,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:47,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 21:05:47,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:47,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-08-12 21:05:47,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:47,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-08-12 21:05:47,075 INFO L142 QuantifierPusher]: treesize reduction 28, result has 72.3 percent of original size [2021-08-12 21:05:47,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-08-12 21:05:47,115 INFO L142 QuantifierPusher]: treesize reduction 26, result has 58.1 percent of original size [2021-08-12 21:05:47,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-08-12 21:05:47,163 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:47,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:47,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:47,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:47,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:47,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:47,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:47,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:47,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:47,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656511931] [2021-08-12 21:05:47,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656511931] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:47,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:47,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-12 21:05:47,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772690784] [2021-08-12 21:05:47,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-12 21:05:47,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-12 21:05:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-08-12 21:05:47,230 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 86 [2021-08-12 21:05:47,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 496 flow. Second operand has 14 states, 14 states have (on average 61.142857142857146) internal successors, (856), 14 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:47,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:47,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 86 [2021-08-12 21:05:47,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:48,913 INFO L129 PetriNetUnfolder]: 815/2543 cut-off events. [2021-08-12 21:05:48,913 INFO L130 PetriNetUnfolder]: For 1011/1039 co-relation queries the response was YES. [2021-08-12 21:05:48,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 2543 events. 815/2543 cut-off events. For 1011/1039 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 22105 event pairs, 38 based on Foata normal form. 6/2522 useless extension candidates. Maximal degree in co-relation 5391. Up to 393 conditions per place. [2021-08-12 21:05:48,925 INFO L132 encePairwiseOnDemand]: 69/86 looper letters, 29 selfloop transitions, 14 changer transitions 305/400 dead transitions. [2021-08-12 21:05:48,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 400 transitions, 2558 flow [2021-08-12 21:05:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-12 21:05:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-08-12 21:05:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2446 transitions. [2021-08-12 21:05:48,931 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7484700122399021 [2021-08-12 21:05:48,932 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2446 transitions. [2021-08-12 21:05:48,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2446 transitions. [2021-08-12 21:05:48,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:48,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2446 transitions. [2021-08-12 21:05:48,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 64.36842105263158) internal successors, (2446), 38 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:48,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 86.0) internal successors, (3354), 39 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:48,944 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 86.0) internal successors, (3354), 39 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:48,945 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 57 predicate places. [2021-08-12 21:05:48,945 INFO L482 AbstractCegarLoop]: Abstraction has has 146 places, 400 transitions, 2558 flow [2021-08-12 21:05:48,945 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 61.142857142857146) internal successors, (856), 14 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:48,945 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:48,945 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:48,946 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 21:05:48,946 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1292040028, now seen corresponding path program 1 times [2021-08-12 21:05:48,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:48,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660736432] [2021-08-12 21:05:48,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:49,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:49,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:49,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:49,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:05:49,105 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.7 percent of original size [2021-08-12 21:05:49,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-08-12 21:05:49,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 21:05:49,140 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.7 percent of original size [2021-08-12 21:05:49,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-08-12 21:05:49,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 21:05:49,207 INFO L142 QuantifierPusher]: treesize reduction 11, result has 57.7 percent of original size [2021-08-12 21:05:49,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-08-12 21:05:49,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:49,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:49,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:49,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:49,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660736432] [2021-08-12 21:05:49,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660736432] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:49,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:49,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 21:05:49,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782066016] [2021-08-12 21:05:49,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 21:05:49,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 21:05:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-12 21:05:49,226 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 86 [2021-08-12 21:05:49,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 400 transitions, 2558 flow. Second operand has 10 states, 10 states have (on average 60.8) internal successors, (608), 10 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:49,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:49,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 86 [2021-08-12 21:05:49,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:50,430 INFO L129 PetriNetUnfolder]: 1375/3522 cut-off events. [2021-08-12 21:05:50,431 INFO L130 PetriNetUnfolder]: For 2211/2259 co-relation queries the response was YES. [2021-08-12 21:05:50,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9305 conditions, 3522 events. 1375/3522 cut-off events. For 2211/2259 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 28382 event pairs, 123 based on Foata normal form. 42/3504 useless extension candidates. Maximal degree in co-relation 9236. Up to 822 conditions per place. [2021-08-12 21:05:50,445 INFO L132 encePairwiseOnDemand]: 72/86 looper letters, 46 selfloop transitions, 12 changer transitions 416/528 dead transitions. [2021-08-12 21:05:50,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 528 transitions, 3628 flow [2021-08-12 21:05:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-12 21:05:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-08-12 21:05:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1516 transitions. [2021-08-12 21:05:50,450 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7664307381193124 [2021-08-12 21:05:50,450 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1516 transitions. [2021-08-12 21:05:50,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1516 transitions. [2021-08-12 21:05:50,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:50,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1516 transitions. [2021-08-12 21:05:50,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 65.91304347826087) internal successors, (1516), 23 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 86.0) internal successors, (2064), 24 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,457 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 86.0) internal successors, (2064), 24 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,458 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 79 predicate places. [2021-08-12 21:05:50,458 INFO L482 AbstractCegarLoop]: Abstraction has has 168 places, 528 transitions, 3628 flow [2021-08-12 21:05:50,458 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 60.8) internal successors, (608), 10 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,458 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:50,458 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:50,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 21:05:50,458 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1747034866, now seen corresponding path program 2 times [2021-08-12 21:05:50,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:50,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352650893] [2021-08-12 21:05:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:50,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:50,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:50,572 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:05:50,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:05:50,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:50,591 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:05:50,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:50,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:50,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:50,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352650893] [2021-08-12 21:05:50,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352650893] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:50,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:50,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:50,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592885290] [2021-08-12 21:05:50,604 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:50,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:50,605 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 86 [2021-08-12 21:05:50,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 528 transitions, 3628 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:50,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 86 [2021-08-12 21:05:50,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:50,895 INFO L129 PetriNetUnfolder]: 635/1616 cut-off events. [2021-08-12 21:05:50,895 INFO L130 PetriNetUnfolder]: For 1059/1064 co-relation queries the response was YES. [2021-08-12 21:05:50,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 1616 events. 635/1616 cut-off events. For 1059/1064 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10933 event pairs, 86 based on Foata normal form. 5/1586 useless extension candidates. Maximal degree in co-relation 4844. Up to 564 conditions per place. [2021-08-12 21:05:50,903 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 8 selfloop transitions, 6 changer transitions 211/295 dead transitions. [2021-08-12 21:05:50,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 295 transitions, 1950 flow [2021-08-12 21:05:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 21:05:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 21:05:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 765 transitions. [2021-08-12 21:05:50,905 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2021-08-12 21:05:50,905 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 765 transitions. [2021-08-12 21:05:50,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 765 transitions. [2021-08-12 21:05:50,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:50,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 765 transitions. [2021-08-12 21:05:50,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.5) internal successors, (765), 10 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,909 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,909 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 73 predicate places. [2021-08-12 21:05:50,909 INFO L482 AbstractCegarLoop]: Abstraction has has 162 places, 295 transitions, 1950 flow [2021-08-12 21:05:50,909 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:50,909 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:50,909 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:50,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 21:05:50,910 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash -443037241, now seen corresponding path program 1 times [2021-08-12 21:05:50,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:50,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826832469] [2021-08-12 21:05:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:50,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:50,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:50,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:50,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:51,004 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:05:51,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:05:51,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:51,026 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:05:51,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:51,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:51,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:51,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826832469] [2021-08-12 21:05:51,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826832469] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:51,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:51,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 21:05:51,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226453831] [2021-08-12 21:05:51,039 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 21:05:51,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 21:05:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 21:05:51,040 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 86 [2021-08-12 21:05:51,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 295 transitions, 1950 flow. Second operand has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:51,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 86 [2021-08-12 21:05:51,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:51,355 INFO L129 PetriNetUnfolder]: 515/1256 cut-off events. [2021-08-12 21:05:51,355 INFO L130 PetriNetUnfolder]: For 1214/1218 co-relation queries the response was YES. [2021-08-12 21:05:51,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 1256 events. 515/1256 cut-off events. For 1214/1218 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8434 event pairs, 44 based on Foata normal form. 4/1242 useless extension candidates. Maximal degree in co-relation 4363. Up to 381 conditions per place. [2021-08-12 21:05:51,361 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 4 selfloop transitions, 8 changer transitions 184/266 dead transitions. [2021-08-12 21:05:51,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 266 transitions, 1942 flow [2021-08-12 21:05:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 21:05:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 21:05:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 985 transitions. [2021-08-12 21:05:51,365 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8810375670840788 [2021-08-12 21:05:51,365 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 985 transitions. [2021-08-12 21:05:51,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 985 transitions. [2021-08-12 21:05:51,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:51,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 985 transitions. [2021-08-12 21:05:51,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 75.76923076923077) internal successors, (985), 13 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,372 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,372 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 64 predicate places. [2021-08-12 21:05:51,372 INFO L482 AbstractCegarLoop]: Abstraction has has 153 places, 266 transitions, 1942 flow [2021-08-12 21:05:51,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,373 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:51,373 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:51,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 21:05:51,373 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1171115680, now seen corresponding path program 1 times [2021-08-12 21:05:51,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:51,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596345389] [2021-08-12 21:05:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:51,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:51,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:51,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:51,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 21:05:51,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-12 21:05:51,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:05:51,528 INFO L142 QuantifierPusher]: treesize reduction 21, result has 67.2 percent of original size [2021-08-12 21:05:51,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-08-12 21:05:51,554 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:51,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:51,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:51,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:51,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:51,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:51,596 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:51,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596345389] [2021-08-12 21:05:51,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596345389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:51,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:51,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 21:05:51,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436771065] [2021-08-12 21:05:51,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 21:05:51,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:51,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 21:05:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-12 21:05:51,599 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 86 [2021-08-12 21:05:51,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 266 transitions, 1942 flow. Second operand has 11 states, 11 states have (on average 67.45454545454545) internal successors, (742), 11 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:51,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 86 [2021-08-12 21:05:51,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:51,959 INFO L129 PetriNetUnfolder]: 680/1822 cut-off events. [2021-08-12 21:05:51,959 INFO L130 PetriNetUnfolder]: For 2467/2485 co-relation queries the response was YES. [2021-08-12 21:05:51,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 1822 events. 680/1822 cut-off events. For 2467/2485 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14249 event pairs, 62 based on Foata normal form. 2/1804 useless extension candidates. Maximal degree in co-relation 6726. Up to 581 conditions per place. [2021-08-12 21:05:51,967 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 13 selfloop transitions, 7 changer transitions 224/302 dead transitions. [2021-08-12 21:05:51,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 302 transitions, 2476 flow [2021-08-12 21:05:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 21:05:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 21:05:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 622 transitions. [2021-08-12 21:05:51,968 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8036175710594315 [2021-08-12 21:05:51,969 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 622 transitions. [2021-08-12 21:05:51,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 622 transitions. [2021-08-12 21:05:51,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:51,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 622 transitions. [2021-08-12 21:05:51,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 69.11111111111111) internal successors, (622), 9 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,972 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,972 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 72 predicate places. [2021-08-12 21:05:51,972 INFO L482 AbstractCegarLoop]: Abstraction has has 161 places, 302 transitions, 2476 flow [2021-08-12 21:05:51,973 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 67.45454545454545) internal successors, (742), 11 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:51,973 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:51,973 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:51,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 21:05:51,973 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash 877478850, now seen corresponding path program 2 times [2021-08-12 21:05:51,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:51,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675689883] [2021-08-12 21:05:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 21:05:52,023 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 21:05:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 21:05:52,068 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 21:05:52,110 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 21:05:52,110 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 21:05:52,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 21:05:52,113 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 21:05:52,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 09:05:52 BasicIcfg [2021-08-12 21:05:52,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 21:05:52,221 INFO L168 Benchmark]: Toolchain (without parser) took 9046.25 ms. Allocated memory was 186.6 MB in the beginning and 375.4 MB in the end (delta: 188.7 MB). Free memory was 149.0 MB in the beginning and 205.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 133.2 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:52,221 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 186.6 MB. Free memory was 167.2 MB in the beginning and 167.1 MB in the end (delta: 84.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 21:05:52,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.76 ms. Allocated memory is still 186.6 MB. Free memory was 148.8 MB in the beginning and 144.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:52,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.35 ms. Allocated memory is still 186.6 MB. Free memory was 144.7 MB in the beginning and 142.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:52,223 INFO L168 Benchmark]: Boogie Preprocessor took 61.71 ms. Allocated memory is still 186.6 MB. Free memory was 142.1 MB in the beginning and 140.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:52,225 INFO L168 Benchmark]: RCFGBuilder took 1554.18 ms. Allocated memory was 186.6 MB in the beginning and 224.4 MB in the end (delta: 37.7 MB). Free memory was 140.0 MB in the beginning and 182.3 MB in the end (delta: -42.3 MB). Peak memory consumption was 86.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:52,226 INFO L168 Benchmark]: TraceAbstraction took 6753.40 ms. Allocated memory was 224.4 MB in the beginning and 375.4 MB in the end (delta: 151.0 MB). Free memory was 181.7 MB in the beginning and 205.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 127.4 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:52,233 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 186.6 MB. Free memory was 167.2 MB in the beginning and 167.1 MB in the end (delta: 84.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 596.76 ms. Allocated memory is still 186.6 MB. Free memory was 148.8 MB in the beginning and 144.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 74.35 ms. Allocated memory is still 186.6 MB. Free memory was 144.7 MB in the beginning and 142.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 61.71 ms. Allocated memory is still 186.6 MB. Free memory was 142.1 MB in the beginning and 140.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1554.18 ms. Allocated memory was 186.6 MB in the beginning and 224.4 MB in the end (delta: 37.7 MB). Free memory was 140.0 MB in the beginning and 182.3 MB in the end (delta: -42.3 MB). Peak memory consumption was 86.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6753.40 ms. Allocated memory was 224.4 MB in the beginning and 375.4 MB in the end (delta: 151.0 MB). Free memory was 181.7 MB in the beginning and 205.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 127.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L792] 0 pthread_t t2017; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L793] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L794] 0 pthread_t t2018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L795] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0: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] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L750] 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) [L750] 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) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 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 [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 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 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 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) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] 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) [L770] 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) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 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 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 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 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 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) [L812] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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 with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6537.1ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4475.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 44.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 84 SDtfs, 510 SDslu, 367 SDs, 0 SdLazy, 818 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 803.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2168.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3628occurred in iteration=5, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 43.0ms SsaConstructionTime, 464.5ms SatisfiabilityAnalysisTime, 1243.5ms InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 2616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...