/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:27:51,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:27:51,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:27:51,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:27:51,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:27:51,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:27:51,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:27:51,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:27:51,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:27:51,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:27:51,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:27:51,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:27:51,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:27:51,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:27:51,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:27:51,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:27:51,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:27:51,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:27:51,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:27:51,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:27:51,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:27:51,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:27:51,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:27:51,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:27:51,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:27:51,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:27:51,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:27:51,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:27:51,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:27:51,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:27:51,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:27:51,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:27:51,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:27:51,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:27:51,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:27:51,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:27:51,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:27:51,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:27:51,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:27:51,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:27:51,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:27:51,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:27:51,906 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:27:51,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:27:51,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:27:51,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:27:51,911 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:27:51,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:27:51,911 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:27:51,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:27:51,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:27:51,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:27:51,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:27:51,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:27:51,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:27:51,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:27:51,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:27:51,913 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:27:51,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:27:51,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:27:51,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:27:51,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:27:51,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:27:51,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:27:51,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:27:51,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:27:51,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:27:51,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:27:51,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:27:51,914 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:27:51,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:27:52,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:27:52,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:27:52,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:27:52,278 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:27:52,278 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:27:52,279 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i [2020-10-16 01:27:52,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc04b3b/2b0b337397714a91bd04df77232a548d/FLAGdf93fb326 [2020-10-16 01:27:52,827 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:27:52,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i [2020-10-16 01:27:52,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc04b3b/2b0b337397714a91bd04df77232a548d/FLAGdf93fb326 [2020-10-16 01:27:53,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc04b3b/2b0b337397714a91bd04df77232a548d [2020-10-16 01:27:53,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:27:53,141 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:27:53,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:27:53,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:27:53,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:27:53,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:53,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b831c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53, skipping insertion in model container [2020-10-16 01:27:53,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:53,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:27:53,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:27:53,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:27:53,803 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:27:53,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:27:53,946 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:27:53,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53 WrapperNode [2020-10-16 01:27:53,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:27:53,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:27:53,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:27:53,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:27:53,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:53,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:27:54,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:27:54,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:27:54,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:27:54,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... [2020-10-16 01:27:54,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:27:54,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:27:54,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:27:54,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:27:54,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:27:54,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:27:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:27:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:27:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:27:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:27:54,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:27:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:27:54,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:27:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:27:54,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:27:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:27:54,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:27:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:27:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:27:54,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:27:54,115 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:27:56,223 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:27:56,224 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:27:56,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:56 BoogieIcfgContainer [2020-10-16 01:27:56,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:27:56,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:27:56,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:27:56,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:27:56,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:27:53" (1/3) ... [2020-10-16 01:27:56,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b12ec06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:56, skipping insertion in model container [2020-10-16 01:27:56,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:53" (2/3) ... [2020-10-16 01:27:56,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b12ec06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:56, skipping insertion in model container [2020-10-16 01:27:56,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:56" (3/3) ... [2020-10-16 01:27:56,235 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc.i [2020-10-16 01:27:56,246 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:27:56,254 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:27:56,255 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:27:56,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,290 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,292 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,299 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,299 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,302 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,302 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,350 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:27:56,377 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:27:56,398 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:27:56,398 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:27:56,398 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:27:56,398 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:27:56,398 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:27:56,398 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:27:56,399 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:27:56,399 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:27:56,412 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 01:27:56,461 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 01:27:56,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:27:56,467 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 01:27:56,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 01:27:56,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2020-10-16 01:27:56,477 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:27:56,479 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2020-10-16 01:27:56,482 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2020-10-16 01:27:56,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2020-10-16 01:27:56,507 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 01:27:56,508 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:27:56,509 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 01:27:56,512 INFO L117 LiptonReduction]: Number of co-enabled transitions 2814 [2020-10-16 01:27:56,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:56,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:56,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:56,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:56,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:56,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:56,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:56,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:27:56,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:56,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:56,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:56,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:56,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:56,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:56,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:27:56,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:27:56,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:56,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:56,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:56,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:56,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:56,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:56,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:56,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:56,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:56,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:56,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:56,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:27:57,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:57,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:57,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:57,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:57,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:58,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:27:58,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:58,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:27:58,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:27:58,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:58,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:58,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:58,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:58,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:58,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:27:58,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,687 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:27:58,812 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:27:58,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:58,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:58,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:58,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:58,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:58,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:27:58,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:58,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:58,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:27:58,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:27:58,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:59,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:27:59,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:27:59,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:59,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:59,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:59,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:59,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:27:59,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:27:59,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:27:59,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:59,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:27:59,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:27:59,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:27:59,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:27:59,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:27:59,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:27:59,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:00,218 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-10-16 01:28:00,463 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 01:28:00,569 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 01:28:00,650 INFO L132 LiptonReduction]: Checked pairs total: 7328 [2020-10-16 01:28:00,651 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-16 01:28:00,654 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4179 [2020-10-16 01:28:00,659 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 01:28:00,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:00,659 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:00,660 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:28:00,661 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1195808, now seen corresponding path program 1 times [2020-10-16 01:28:00,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:00,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820328408] [2020-10-16 01:28:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:00,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820328408] [2020-10-16 01:28:00,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:00,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:28:00,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095185381] [2020-10-16 01:28:00,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:00,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:00,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:00,962 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2020-10-16 01:28:00,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:28:00,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:00,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2020-10-16 01:28:00,968 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:01,163 INFO L129 PetriNetUnfolder]: 133/294 cut-off events. [2020-10-16 01:28:01,163 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:01,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 294 events. 133/294 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1584 event pairs, 29 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 502. Up to 153 conditions per place. [2020-10-16 01:28:01,171 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 11 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2020-10-16 01:28:01,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 106 flow [2020-10-16 01:28:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2020-10-16 01:28:01,194 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8983333333333333 [2020-10-16 01:28:01,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2020-10-16 01:28:01,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2020-10-16 01:28:01,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:01,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2020-10-16 01:28:01,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:01,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:01,217 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:01,219 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 539 transitions. [2020-10-16 01:28:01,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 106 flow [2020-10-16 01:28:01,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:28:01,229 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow [2020-10-16 01:28:01,232 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2020-10-16 01:28:01,233 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2020-10-16 01:28:01,233 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2020-10-16 01:28:01,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:01,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:01,234 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:01,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:28:01,234 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash 274393844, now seen corresponding path program 1 times [2020-10-16 01:28:01,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:01,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73749034] [2020-10-16 01:28:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:01,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73749034] [2020-10-16 01:28:01,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:01,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:28:01,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541952178] [2020-10-16 01:28:01,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:01,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:01,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:01,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:01,418 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 200 [2020-10-16 01:28:01,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 01:28:01,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:01,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 200 [2020-10-16 01:28:01,421 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:01,447 INFO L129 PetriNetUnfolder]: 7/51 cut-off events. [2020-10-16 01:28:01,447 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:01,448 INFO L80 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 51 events. 7/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 124 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 73. Up to 17 conditions per place. [2020-10-16 01:28:01,448 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 3 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2020-10-16 01:28:01,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 92 flow [2020-10-16 01:28:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2020-10-16 01:28:01,451 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.915 [2020-10-16 01:28:01,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2020-10-16 01:28:01,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2020-10-16 01:28:01,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:01,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2020-10-16 01:28:01,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:01,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:01,454 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:01,455 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 549 transitions. [2020-10-16 01:28:01,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 92 flow [2020-10-16 01:28:01,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:01,456 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 83 flow [2020-10-16 01:28:01,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 01:28:01,457 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2020-10-16 01:28:01,457 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 83 flow [2020-10-16 01:28:01,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:01,458 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:01,458 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:01,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:28:01,458 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:01,459 INFO L82 PathProgramCache]: Analyzing trace with hash -83726086, now seen corresponding path program 1 times [2020-10-16 01:28:01,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:01,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895965220] [2020-10-16 01:28:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:01,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895965220] [2020-10-16 01:28:01,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:01,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:28:01,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562838462] [2020-10-16 01:28:01,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:01,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:01,527 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 200 [2020-10-16 01:28:01,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 83 flow. Second operand 3 states. [2020-10-16 01:28:01,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:01,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 200 [2020-10-16 01:28:01,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:01,538 INFO L129 PetriNetUnfolder]: 3/40 cut-off events. [2020-10-16 01:28:01,538 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 01:28:01,539 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 40 events. 3/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 1 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2020-10-16 01:28:01,539 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 1 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2020-10-16 01:28:01,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 89 flow [2020-10-16 01:28:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2020-10-16 01:28:01,542 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2020-10-16 01:28:01,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2020-10-16 01:28:01,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2020-10-16 01:28:01,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:01,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2020-10-16 01:28:01,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:01,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:01,545 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:01,545 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 83 flow. Second operand 3 states and 550 transitions. [2020-10-16 01:28:01,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 89 flow [2020-10-16 01:28:01,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:01,547 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2020-10-16 01:28:01,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2020-10-16 01:28:01,547 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2020-10-16 01:28:01,547 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 88 flow [2020-10-16 01:28:01,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:01,548 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:01,548 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:01,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:28:01,548 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1143984854, now seen corresponding path program 1 times [2020-10-16 01:28:01,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:01,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350783370] [2020-10-16 01:28:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:01,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350783370] [2020-10-16 01:28:01,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:01,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:28:01,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372152082] [2020-10-16 01:28:01,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:01,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:01,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:01,593 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 200 [2020-10-16 01:28:01,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 88 flow. Second operand 3 states. [2020-10-16 01:28:01,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:01,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 200 [2020-10-16 01:28:01,594 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:01,610 INFO L129 PetriNetUnfolder]: 10/62 cut-off events. [2020-10-16 01:28:01,610 INFO L130 PetriNetUnfolder]: For 21/30 co-relation queries the response was YES. [2020-10-16 01:28:01,611 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 62 events. 10/62 cut-off events. For 21/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 3 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 107. Up to 19 conditions per place. [2020-10-16 01:28:01,612 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2020-10-16 01:28:01,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 104 flow [2020-10-16 01:28:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2020-10-16 01:28:01,614 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9116666666666666 [2020-10-16 01:28:01,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2020-10-16 01:28:01,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2020-10-16 01:28:01,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:01,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2020-10-16 01:28:01,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:01,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:01,617 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:01,617 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 88 flow. Second operand 3 states and 547 transitions. [2020-10-16 01:28:01,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 104 flow [2020-10-16 01:28:01,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:01,619 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 103 flow [2020-10-16 01:28:01,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2020-10-16 01:28:01,620 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2020-10-16 01:28:01,620 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 103 flow [2020-10-16 01:28:01,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:01,620 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:01,620 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:01,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:28:01,621 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:01,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:01,621 INFO L82 PathProgramCache]: Analyzing trace with hash -604935538, now seen corresponding path program 1 times [2020-10-16 01:28:01,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:01,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926292524] [2020-10-16 01:28:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:01,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926292524] [2020-10-16 01:28:01,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:01,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:28:01,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747816790] [2020-10-16 01:28:01,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:01,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:01,658 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 200 [2020-10-16 01:28:01,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 103 flow. Second operand 3 states. [2020-10-16 01:28:01,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:01,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 200 [2020-10-16 01:28:01,659 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:01,676 INFO L129 PetriNetUnfolder]: 4/60 cut-off events. [2020-10-16 01:28:01,676 INFO L130 PetriNetUnfolder]: For 48/83 co-relation queries the response was YES. [2020-10-16 01:28:01,677 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 60 events. 4/60 cut-off events. For 48/83 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 209 event pairs, 1 based on Foata normal form. 4/60 useless extension candidates. Maximal degree in co-relation 112. Up to 15 conditions per place. [2020-10-16 01:28:01,677 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2020-10-16 01:28:01,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 115 flow [2020-10-16 01:28:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2020-10-16 01:28:01,680 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.91 [2020-10-16 01:28:01,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2020-10-16 01:28:01,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2020-10-16 01:28:01,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:01,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2020-10-16 01:28:01,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:01,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:01,683 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:01,683 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 103 flow. Second operand 3 states and 546 transitions. [2020-10-16 01:28:01,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 115 flow [2020-10-16 01:28:01,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:01,685 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 111 flow [2020-10-16 01:28:01,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2020-10-16 01:28:01,686 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2020-10-16 01:28:01,686 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 111 flow [2020-10-16 01:28:01,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:01,686 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:01,686 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:01,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:28:01,686 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:01,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1102995740, now seen corresponding path program 1 times [2020-10-16 01:28:01,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:01,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771688708] [2020-10-16 01:28:01,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:01,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771688708] [2020-10-16 01:28:01,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:01,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:28:01,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040153016] [2020-10-16 01:28:01,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:01,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:01,756 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2020-10-16 01:28:01,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 111 flow. Second operand 4 states. [2020-10-16 01:28:01,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:01,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2020-10-16 01:28:01,757 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:01,864 INFO L129 PetriNetUnfolder]: 253/505 cut-off events. [2020-10-16 01:28:01,864 INFO L130 PetriNetUnfolder]: For 309/357 co-relation queries the response was YES. [2020-10-16 01:28:01,867 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 505 events. 253/505 cut-off events. For 309/357 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3053 event pairs, 125 based on Foata normal form. 38/477 useless extension candidates. Maximal degree in co-relation 1116. Up to 315 conditions per place. [2020-10-16 01:28:01,871 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 9 selfloop transitions, 9 changer transitions 2/45 dead transitions. [2020-10-16 01:28:01,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 177 flow [2020-10-16 01:28:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2020-10-16 01:28:01,875 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.862 [2020-10-16 01:28:01,875 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2020-10-16 01:28:01,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2020-10-16 01:28:01,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:01,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2020-10-16 01:28:01,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:01,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:01,880 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:01,880 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 111 flow. Second operand 5 states and 862 transitions. [2020-10-16 01:28:01,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 177 flow [2020-10-16 01:28:01,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 172 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:01,884 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 175 flow [2020-10-16 01:28:01,884 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2020-10-16 01:28:01,884 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2020-10-16 01:28:01,885 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 175 flow [2020-10-16 01:28:01,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:01,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:01,885 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:01,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:28:01,885 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash -682489081, now seen corresponding path program 1 times [2020-10-16 01:28:01,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:01,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427677341] [2020-10-16 01:28:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:01,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427677341] [2020-10-16 01:28:01,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:01,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:28:01,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678306306] [2020-10-16 01:28:01,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:01,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:01,935 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 200 [2020-10-16 01:28:01,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 175 flow. Second operand 3 states. [2020-10-16 01:28:01,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:01,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 200 [2020-10-16 01:28:01,936 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:02,070 INFO L129 PetriNetUnfolder]: 359/693 cut-off events. [2020-10-16 01:28:02,071 INFO L130 PetriNetUnfolder]: For 1083/1282 co-relation queries the response was YES. [2020-10-16 01:28:02,073 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 693 events. 359/693 cut-off events. For 1083/1282 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4412 event pairs, 194 based on Foata normal form. 25/632 useless extension candidates. Maximal degree in co-relation 2036. Up to 527 conditions per place. [2020-10-16 01:28:02,077 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 3 changer transitions 4/40 dead transitions. [2020-10-16 01:28:02,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 187 flow [2020-10-16 01:28:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2020-10-16 01:28:02,079 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.91 [2020-10-16 01:28:02,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2020-10-16 01:28:02,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2020-10-16 01:28:02,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:02,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2020-10-16 01:28:02,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:02,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:02,082 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:02,082 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 175 flow. Second operand 3 states and 546 transitions. [2020-10-16 01:28:02,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 187 flow [2020-10-16 01:28:02,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:02,086 INFO L241 Difference]: Finished difference. Result has 53 places, 36 transitions, 157 flow [2020-10-16 01:28:02,086 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2020-10-16 01:28:02,087 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2020-10-16 01:28:02,087 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 157 flow [2020-10-16 01:28:02,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:02,087 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:02,087 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:02,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:28:02,087 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:02,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1943519287, now seen corresponding path program 1 times [2020-10-16 01:28:02,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:02,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762496145] [2020-10-16 01:28:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:02,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762496145] [2020-10-16 01:28:02,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:02,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:28:02,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479711102] [2020-10-16 01:28:02,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:28:02,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:02,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:28:02,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:28:02,161 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2020-10-16 01:28:02,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 157 flow. Second operand 5 states. [2020-10-16 01:28:02,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:02,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2020-10-16 01:28:02,162 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:02,286 INFO L129 PetriNetUnfolder]: 265/536 cut-off events. [2020-10-16 01:28:02,287 INFO L130 PetriNetUnfolder]: For 654/834 co-relation queries the response was YES. [2020-10-16 01:28:02,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 536 events. 265/536 cut-off events. For 654/834 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3130 event pairs, 59 based on Foata normal form. 69/548 useless extension candidates. Maximal degree in co-relation 1999. Up to 420 conditions per place. [2020-10-16 01:28:02,291 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 9 changer transitions 9/49 dead transitions. [2020-10-16 01:28:02,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 281 flow [2020-10-16 01:28:02,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:28:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:28:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2020-10-16 01:28:02,295 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8616666666666667 [2020-10-16 01:28:02,295 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1034 transitions. [2020-10-16 01:28:02,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1034 transitions. [2020-10-16 01:28:02,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:02,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1034 transitions. [2020-10-16 01:28:02,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:28:02,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:28:02,300 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:28:02,301 INFO L185 Difference]: Start difference. First operand has 53 places, 36 transitions, 157 flow. Second operand 6 states and 1034 transitions. [2020-10-16 01:28:02,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 281 flow [2020-10-16 01:28:02,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 274 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:02,306 INFO L241 Difference]: Finished difference. Result has 57 places, 40 transitions, 222 flow [2020-10-16 01:28:02,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2020-10-16 01:28:02,306 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2020-10-16 01:28:02,306 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 222 flow [2020-10-16 01:28:02,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:28:02,307 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:02,307 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:02,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:28:02,307 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:02,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1785773871, now seen corresponding path program 1 times [2020-10-16 01:28:02,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:02,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062483809] [2020-10-16 01:28:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:02,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062483809] [2020-10-16 01:28:02,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:02,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:28:02,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848638030] [2020-10-16 01:28:02,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:02,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:02,350 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 200 [2020-10-16 01:28:02,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 222 flow. Second operand 3 states. [2020-10-16 01:28:02,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:02,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 200 [2020-10-16 01:28:02,351 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:02,463 INFO L129 PetriNetUnfolder]: 396/789 cut-off events. [2020-10-16 01:28:02,464 INFO L130 PetriNetUnfolder]: For 2205/2644 co-relation queries the response was YES. [2020-10-16 01:28:02,467 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 789 events. 396/789 cut-off events. For 2205/2644 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 4916 event pairs, 110 based on Foata normal form. 30/730 useless extension candidates. Maximal degree in co-relation 3430. Up to 594 conditions per place. [2020-10-16 01:28:02,470 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2020-10-16 01:28:02,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 41 transitions, 234 flow [2020-10-16 01:28:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2020-10-16 01:28:02,473 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.91 [2020-10-16 01:28:02,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2020-10-16 01:28:02,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2020-10-16 01:28:02,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:02,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2020-10-16 01:28:02,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:02,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:02,476 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:02,476 INFO L185 Difference]: Start difference. First operand has 57 places, 40 transitions, 222 flow. Second operand 3 states and 546 transitions. [2020-10-16 01:28:02,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 41 transitions, 234 flow [2020-10-16 01:28:02,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 196 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-16 01:28:02,489 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 196 flow [2020-10-16 01:28:02,489 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2020-10-16 01:28:02,489 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2020-10-16 01:28:02,489 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 196 flow [2020-10-16 01:28:02,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:02,490 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:02,490 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:02,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:28:02,490 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1033150635, now seen corresponding path program 2 times [2020-10-16 01:28:02,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:02,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127561699] [2020-10-16 01:28:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:02,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127561699] [2020-10-16 01:28:02,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:02,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:28:02,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324891719] [2020-10-16 01:28:02,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:28:02,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:28:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:28:02,578 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2020-10-16 01:28:02,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 196 flow. Second operand 6 states. [2020-10-16 01:28:02,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:02,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2020-10-16 01:28:02,579 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:02,721 INFO L129 PetriNetUnfolder]: 280/607 cut-off events. [2020-10-16 01:28:02,721 INFO L130 PetriNetUnfolder]: For 871/1440 co-relation queries the response was YES. [2020-10-16 01:28:02,723 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 607 events. 280/607 cut-off events. For 871/1440 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3577 event pairs, 16 based on Foata normal form. 152/691 useless extension candidates. Maximal degree in co-relation 2518. Up to 484 conditions per place. [2020-10-16 01:28:02,725 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 13 changer transitions 9/54 dead transitions. [2020-10-16 01:28:02,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 354 flow [2020-10-16 01:28:02,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:28:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:28:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1206 transitions. [2020-10-16 01:28:02,730 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8614285714285714 [2020-10-16 01:28:02,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1206 transitions. [2020-10-16 01:28:02,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1206 transitions. [2020-10-16 01:28:02,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:02,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1206 transitions. [2020-10-16 01:28:02,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:28:02,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:28:02,735 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:28:02,736 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 196 flow. Second operand 7 states and 1206 transitions. [2020-10-16 01:28:02,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 354 flow [2020-10-16 01:28:02,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:02,739 INFO L241 Difference]: Finished difference. Result has 62 places, 45 transitions, 282 flow [2020-10-16 01:28:02,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2020-10-16 01:28:02,740 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2020-10-16 01:28:02,740 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 282 flow [2020-10-16 01:28:02,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:28:02,740 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:02,740 INFO L255 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] [2020-10-16 01:28:02,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:28:02,741 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1148235642, now seen corresponding path program 1 times [2020-10-16 01:28:02,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:02,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400807627] [2020-10-16 01:28:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:02,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400807627] [2020-10-16 01:28:02,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:02,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:28:02,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320793014] [2020-10-16 01:28:02,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:28:02,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:28:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:28:02,902 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2020-10-16 01:28:02,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 282 flow. Second operand 7 states. [2020-10-16 01:28:02,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:02,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2020-10-16 01:28:02,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:03,029 INFO L129 PetriNetUnfolder]: 152/359 cut-off events. [2020-10-16 01:28:03,029 INFO L130 PetriNetUnfolder]: For 1138/1877 co-relation queries the response was YES. [2020-10-16 01:28:03,031 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1880 conditions, 359 events. 152/359 cut-off events. For 1138/1877 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1858 event pairs, 0 based on Foata normal form. 132/438 useless extension candidates. Maximal degree in co-relation 1856. Up to 281 conditions per place. [2020-10-16 01:28:03,032 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 2 selfloop transitions, 17 changer transitions 9/50 dead transitions. [2020-10-16 01:28:03,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 50 transitions, 386 flow [2020-10-16 01:28:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:28:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:28:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1370 transitions. [2020-10-16 01:28:03,037 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.85625 [2020-10-16 01:28:03,037 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1370 transitions. [2020-10-16 01:28:03,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1370 transitions. [2020-10-16 01:28:03,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:03,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1370 transitions. [2020-10-16 01:28:03,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:28:03,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:28:03,044 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:28:03,044 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 282 flow. Second operand 8 states and 1370 transitions. [2020-10-16 01:28:03,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 50 transitions, 386 flow [2020-10-16 01:28:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 50 transitions, 316 flow, removed 25 selfloop flow, removed 6 redundant places. [2020-10-16 01:28:03,051 INFO L241 Difference]: Finished difference. Result has 64 places, 41 transitions, 248 flow [2020-10-16 01:28:03,051 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2020-10-16 01:28:03,052 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2020-10-16 01:28:03,052 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 248 flow [2020-10-16 01:28:03,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:28:03,052 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:03,052 INFO L255 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] [2020-10-16 01:28:03,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:28:03,053 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1781226049, now seen corresponding path program 1 times [2020-10-16 01:28:03,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:03,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768502377] [2020-10-16 01:28:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:28:03,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768502377] [2020-10-16 01:28:03,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:03,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:28:03,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142836965] [2020-10-16 01:28:03,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:28:03,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:28:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:28:03,524 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 200 [2020-10-16 01:28:03,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 248 flow. Second operand 8 states. [2020-10-16 01:28:03,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:03,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 200 [2020-10-16 01:28:03,525 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:03,815 INFO L129 PetriNetUnfolder]: 242/537 cut-off events. [2020-10-16 01:28:03,815 INFO L130 PetriNetUnfolder]: For 822/915 co-relation queries the response was YES. [2020-10-16 01:28:03,819 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1769 conditions, 537 events. 242/537 cut-off events. For 822/915 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3105 event pairs, 21 based on Foata normal form. 2/497 useless extension candidates. Maximal degree in co-relation 1745. Up to 182 conditions per place. [2020-10-16 01:28:03,821 INFO L132 encePairwiseOnDemand]: 192/200 looper letters, 7 selfloop transitions, 5 changer transitions 13/57 dead transitions. [2020-10-16 01:28:03,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 342 flow [2020-10-16 01:28:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:28:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:28:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2020-10-16 01:28:03,824 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2020-10-16 01:28:03,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 896 transitions. [2020-10-16 01:28:03,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 896 transitions. [2020-10-16 01:28:03,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:03,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 896 transitions. [2020-10-16 01:28:03,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:28:03,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:28:03,829 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:28:03,829 INFO L185 Difference]: Start difference. First operand has 64 places, 41 transitions, 248 flow. Second operand 6 states and 896 transitions. [2020-10-16 01:28:03,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 342 flow [2020-10-16 01:28:03,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 250 flow, removed 27 selfloop flow, removed 13 redundant places. [2020-10-16 01:28:03,838 INFO L241 Difference]: Finished difference. Result has 57 places, 44 transitions, 202 flow [2020-10-16 01:28:03,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2020-10-16 01:28:03,838 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2020-10-16 01:28:03,838 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 202 flow [2020-10-16 01:28:03,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:28:03,838 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:03,839 INFO L255 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] [2020-10-16 01:28:03,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:28:03,839 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:03,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1123748689, now seen corresponding path program 2 times [2020-10-16 01:28:03,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:03,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162786233] [2020-10-16 01:28:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:28:03,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:28:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:28:04,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:28:04,038 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:28:04,038 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:28:04,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:28:04,040 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:28:04,058 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1157] [1157] L2-->L874: Formula: (let ((.cse7 (= (mod ~b$r_buff1_thd0~0_In-89221892 256) 0)) (.cse6 (= (mod ~b$w_buff1_used~0_In-89221892 256) 0)) (.cse8 (= (mod ~b$r_buff0_thd0~0_In-89221892 256) 0)) (.cse9 (= (mod ~b$w_buff0_used~0_In-89221892 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-89221892 0)) (or (and .cse0 .cse1 (= ~b$w_buff0_used~0_Out-89221892 0)) (and .cse2 (= ~b$w_buff0_used~0_Out-89221892 ~b$w_buff0_used~0_In-89221892))) (or (and (or (and .cse3 (= ~b~0_Out-89221892 ~b~0_In-89221892)) (and (= ~b$w_buff1~0_In-89221892 ~b~0_Out-89221892) .cse4 .cse5)) .cse2) (and .cse0 .cse1 (= ~b$w_buff0~0_In-89221892 ~b~0_Out-89221892))) (or (and (= ~b$w_buff1_used~0_Out-89221892 ~b$w_buff1_used~0_In-89221892) .cse3) (and (= ~b$w_buff1_used~0_Out-89221892 0) .cse4 .cse5)) (= ~b$r_buff0_thd0~0_In-89221892 ~b$r_buff0_thd0~0_Out-89221892) (= ~b$r_buff1_thd0~0_In-89221892 ~b$r_buff1_thd0~0_Out-89221892) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-89221892| ULTIMATE.start_assume_abort_if_not_~cond_Out-89221892)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-89221892, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-89221892|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-89221892, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-89221892, ~b~0=~b~0_In-89221892, ~b$w_buff1~0=~b$w_buff1~0_In-89221892, ~b$w_buff0~0=~b$w_buff0~0_In-89221892, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-89221892} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-89221892, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-89221892|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-89221892|, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out-89221892|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out-89221892|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-89221892|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-89221892|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out-89221892, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-89221892|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-89221892, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out-89221892, ~b~0=~b~0_Out-89221892, ~b$w_buff1~0=~b$w_buff1~0_In-89221892, ~b$w_buff0~0=~b$w_buff0~0_In-89221892, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out-89221892} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2020-10-16 01:28:04,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,066 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:28:04,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:04,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:28:04 BasicIcfg [2020-10-16 01:28:04,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:28:04,166 INFO L168 Benchmark]: Toolchain (without parser) took 11024.68 ms. Allocated memory was 248.0 MB in the beginning and 589.3 MB in the end (delta: 341.3 MB). Free memory was 202.2 MB in the beginning and 402.9 MB in the end (delta: -200.7 MB). Peak memory consumption was 140.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:04,166 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:28:04,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.05 ms. Allocated memory was 248.0 MB in the beginning and 302.0 MB in the end (delta: 54.0 MB). Free memory was 202.2 MB in the beginning and 252.7 MB in the end (delta: -50.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:04,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 302.0 MB. Free memory was 252.7 MB in the beginning and 250.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:04,169 INFO L168 Benchmark]: Boogie Preprocessor took 39.10 ms. Allocated memory is still 302.0 MB. Free memory was 250.2 MB in the beginning and 247.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:04,171 INFO L168 Benchmark]: RCFGBuilder took 2172.53 ms. Allocated memory was 302.0 MB in the beginning and 354.4 MB in the end (delta: 52.4 MB). Free memory was 247.6 MB in the beginning and 154.0 MB in the end (delta: 93.7 MB). Peak memory consumption was 146.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:04,172 INFO L168 Benchmark]: TraceAbstraction took 7936.75 ms. Allocated memory was 354.4 MB in the beginning and 589.3 MB in the end (delta: 234.9 MB). Free memory was 154.0 MB in the beginning and 402.9 MB in the end (delta: -248.9 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:28:04,178 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 806.05 ms. Allocated memory was 248.0 MB in the beginning and 302.0 MB in the end (delta: 54.0 MB). Free memory was 202.2 MB in the beginning and 252.7 MB in the end (delta: -50.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 302.0 MB. Free memory was 252.7 MB in the beginning and 250.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.10 ms. Allocated memory is still 302.0 MB. Free memory was 250.2 MB in the beginning and 247.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2172.53 ms. Allocated memory was 302.0 MB in the beginning and 354.4 MB in the end (delta: 52.4 MB). Free memory was 247.6 MB in the beginning and 154.0 MB in the end (delta: 93.7 MB). Peak memory consumption was 146.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7936.75 ms. Allocated memory was 354.4 MB in the beginning and 589.3 MB in the end (delta: 234.9 MB). Free memory was 154.0 MB in the beginning and 402.9 MB in the end (delta: -248.9 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1706 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 82 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 241 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.1s, 120 PlacesBefore, 43 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2814 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 7328 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool b$flush_delayed; [L709] 0 int b$mem_tmp; [L710] 0 _Bool b$r_buff0_thd0; [L711] 0 _Bool b$r_buff0_thd1; [L712] 0 _Bool b$r_buff0_thd2; [L713] 0 _Bool b$r_buff0_thd3; [L714] 0 _Bool b$r_buff0_thd4; [L715] 0 _Bool b$r_buff1_thd0; [L716] 0 _Bool b$r_buff1_thd1; [L717] 0 _Bool b$r_buff1_thd2; [L718] 0 _Bool b$r_buff1_thd3; [L719] 0 _Bool b$r_buff1_thd4; [L720] 0 _Bool b$read_delayed; [L721] 0 int *b$read_delayed_var; [L722] 0 int b$w_buff0; [L723] 0 _Bool b$w_buff0_used; [L724] 0 int b$w_buff1; [L725] 0 _Bool b$w_buff1_used; [L726] 0 _Bool main$tmp_guard0; [L727] 0 _Bool main$tmp_guard1; [L729] 0 int x = 0; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1249; [L857] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] 0 pthread_t t1250; [L859] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] 0 pthread_t t1251; [L861] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L744] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L745] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L746] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L747] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L748] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L749] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L775] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L775] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L776] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L776] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L777] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L777] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L778] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L778] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L779] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L779] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L862] 0 pthread_t t1252; [L863] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L809] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L812] 4 a = 1 [L815] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L818] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 4 b$flush_delayed = weak$$choice2 [L821] 4 b$mem_tmp = b [L822] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L822] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L823] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L823] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L823] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0 [L823] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L823] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L823] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L824] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L824] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L825] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L825] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L826] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L827] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L828] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 __unbuffered_p3_EBX = b [L830] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L830] 4 b = b$flush_delayed ? b$mem_tmp : b [L831] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2] [L755] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L755] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L756] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L757] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L757] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L758] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L758] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L759] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L759] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L795] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L795] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L795] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L795] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L796] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L796] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L797] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L797] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L798] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L798] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L799] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L799] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L834] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L834] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L834] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L834] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L835] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L835] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L836] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L836] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L837] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L837] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L838] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L838] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L876] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 45 SDtfs, 17 SDslu, 22 SDs, 0 SdLazy, 290 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 22592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...