/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-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:03:32,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:03:32,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:03:32,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:03:32,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:03:32,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:03:32,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:03:32,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:03:32,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:03:32,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:03:32,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:03:32,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:03:32,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:03:32,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:03:32,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:03:32,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:03:32,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:03:32,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:03:32,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:03:32,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:03:32,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:03:32,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:03:32,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:03:32,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:03:32,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:03:32,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:03:32,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:03:32,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:03:32,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:03:32,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:03:32,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:03:32,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:03:32,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:03:32,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:03:32,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:03:32,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:03:32,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:03:32,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:03:32,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:03:32,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:03:32,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:03:32,950 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-FA-SemanticLbe.epf [2020-10-15 22:03:32,977 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:03:32,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:03:32,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:03:32,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:03:32,979 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:03:32,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:03:32,979 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:03:32,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:03:32,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:03:32,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:03:32,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:03:32,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:03:32,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:03:32,981 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:03:32,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:03:32,981 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:03:32,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:03:32,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:03:32,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:03:32,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:03:32,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:03:32,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:03:32,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:03:32,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:03:32,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:03:32,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:03:32,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:03:32,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:03:32,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:03:33,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:03:33,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:03:33,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:03:33,343 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:03:33,343 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:03:33,344 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2020-10-15 22:03:33,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2218182bd/ff7e18b0de394c44a8990fd2d354eec3/FLAGdfa292bad [2020-10-15 22:03:33,957 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:03:33,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2020-10-15 22:03:33,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2218182bd/ff7e18b0de394c44a8990fd2d354eec3/FLAGdfa292bad [2020-10-15 22:03:34,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2218182bd/ff7e18b0de394c44a8990fd2d354eec3 [2020-10-15 22:03:34,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:03:34,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:03:34,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:03:34,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:03:34,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:03:34,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:34,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e6a114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34, skipping insertion in model container [2020-10-15 22:03:34,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:34,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:03:34,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:03:34,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:03:34,850 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:03:34,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:03:34,998 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:03:34,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34 WrapperNode [2020-10-15 22:03:34,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:03:35,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:03:35,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:03:35,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:03:35,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:03:35,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:03:35,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:03:35,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:03:35,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (1/1) ... [2020-10-15 22:03:35,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:03:35,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:03:35,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:03:35,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:03:35,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (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-15 22:03:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:03:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:03:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:03:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:03:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:03:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:03:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:03:35,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:03:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:03:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:03:35,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:03:35,185 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:03:37,079 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:03:37,079 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:03:37,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:03:37 BoogieIcfgContainer [2020-10-15 22:03:37,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:03:37,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:03:37,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:03:37,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:03:37,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:03:34" (1/3) ... [2020-10-15 22:03:37,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267a616a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:03:37, skipping insertion in model container [2020-10-15 22:03:37,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:03:34" (2/3) ... [2020-10-15 22:03:37,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267a616a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:03:37, skipping insertion in model container [2020-10-15 22:03:37,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:03:37" (3/3) ... [2020-10-15 22:03:37,089 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2020-10-15 22:03:37,100 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:03:37,101 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:03:37,108 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:03:37,109 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:03:37,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,134 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:03:37,170 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-15 22:03:37,191 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:03:37,191 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:03:37,191 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:03:37,191 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:03:37,191 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:03:37,191 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:03:37,192 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:03:37,192 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:03:37,204 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:03:37,207 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 166 flow [2020-10-15 22:03:37,210 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 166 flow [2020-10-15 22:03:37,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-15 22:03:37,253 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-15 22:03:37,253 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:03:37,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-15 22:03:37,261 INFO L117 LiptonReduction]: Number of co-enabled transitions 1012 [2020-10-15 22:03:37,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:37,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:03:37,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:37,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:37,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:37,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:37,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:37,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:37,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:37,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:37,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:37,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:37,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:37,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:37,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:37,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:37,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:37,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:37,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 22:03:37,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:38,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:38,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:38,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:38,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:38,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:38,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:38,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:03:38,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:38,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,533 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 22:03:38,646 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 22:03:38,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:38,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:03:38,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:38,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:38,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:38,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:38,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:38,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:38,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:38,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:38,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:38,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:38,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:39,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:39,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:39,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:39,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:39,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:39,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:39,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:39,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:40,232 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-15 22:03:40,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-15 22:03:40,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:40,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:40,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,489 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-15 22:03:41,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:41,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:41,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:41,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 22:03:41,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:41,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:41,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:41,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:41,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:41,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:41,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 22:03:41,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:03:41,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:03:41,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:41,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:03:41,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 22:03:41,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:41,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:41,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:41,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:41,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:41,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:41,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:41,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:41,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:41,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:41,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:41,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:41,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:41,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:41,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:41,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:41,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:41,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:42,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:42,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:42,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:42,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:42,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:42,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:42,326 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 22:03:42,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:42,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:42,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:42,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:42,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:42,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:42,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:42,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:42,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:43,499 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-15 22:03:43,788 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 22:03:44,471 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-15 22:03:44,798 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-15 22:03:45,435 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-15 22:03:45,744 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-15 22:03:46,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:03:46,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:46,557 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-15 22:03:46,878 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-15 22:03:47,236 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-15 22:03:47,336 INFO L132 LiptonReduction]: Checked pairs total: 3022 [2020-10-15 22:03:47,337 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-15 22:03:47,343 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 52 flow [2020-10-15 22:03:47,362 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states. [2020-10-15 22:03:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2020-10-15 22:03:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:03:47,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:47,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:03:47,372 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 872957254, now seen corresponding path program 1 times [2020-10-15 22:03:47,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:47,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26342555] [2020-10-15 22:03:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:47,643 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-15 22:03:47,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26342555] [2020-10-15 22:03:47,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:47,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:03:47,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046681985] [2020-10-15 22:03:47,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:47,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:47,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:47,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:47,669 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2020-10-15 22:03:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:47,745 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-15 22:03:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:47,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:03:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:47,761 INFO L225 Difference]: With dead ends: 187 [2020-10-15 22:03:47,761 INFO L226 Difference]: Without dead ends: 152 [2020-10-15 22:03:47,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-15 22:03:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-15 22:03:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-15 22:03:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions. [2020-10-15 22:03:47,816 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5 [2020-10-15 22:03:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:47,817 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 357 transitions. [2020-10-15 22:03:47,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions. [2020-10-15 22:03:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 22:03:47,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:47,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:47,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:03:47,818 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1393376099, now seen corresponding path program 1 times [2020-10-15 22:03:47,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:47,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241420234] [2020-10-15 22:03:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:47,943 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-15 22:03:47,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241420234] [2020-10-15 22:03:47,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:47,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:03:47,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26472975] [2020-10-15 22:03:47,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:47,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:47,946 INFO L87 Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 3 states. [2020-10-15 22:03:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:47,977 INFO L93 Difference]: Finished difference Result 147 states and 343 transitions. [2020-10-15 22:03:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:47,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 22:03:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:47,980 INFO L225 Difference]: With dead ends: 147 [2020-10-15 22:03:47,980 INFO L226 Difference]: Without dead ends: 147 [2020-10-15 22:03:47,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-15 22:03:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-15 22:03:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-15 22:03:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 343 transitions. [2020-10-15 22:03:47,997 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 343 transitions. Word has length 7 [2020-10-15 22:03:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:47,997 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 343 transitions. [2020-10-15 22:03:47,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 343 transitions. [2020-10-15 22:03:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-15 22:03:47,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:47,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:47,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:03:47,999 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 243471209, now seen corresponding path program 1 times [2020-10-15 22:03:48,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285514844] [2020-10-15 22:03:48,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:48,076 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-15 22:03:48,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285514844] [2020-10-15 22:03:48,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:48,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:03:48,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625582215] [2020-10-15 22:03:48,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:03:48,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:03:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:03:48,078 INFO L87 Difference]: Start difference. First operand 147 states and 343 transitions. Second operand 4 states. [2020-10-15 22:03:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:48,143 INFO L93 Difference]: Finished difference Result 141 states and 326 transitions. [2020-10-15 22:03:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:48,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-15 22:03:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:48,146 INFO L225 Difference]: With dead ends: 141 [2020-10-15 22:03:48,146 INFO L226 Difference]: Without dead ends: 141 [2020-10-15 22:03:48,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-15 22:03:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-15 22:03:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-15 22:03:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 326 transitions. [2020-10-15 22:03:48,159 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 326 transitions. Word has length 8 [2020-10-15 22:03:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:48,159 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 326 transitions. [2020-10-15 22:03:48,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:03:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 326 transitions. [2020-10-15 22:03:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 22:03:48,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:48,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:48,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:03:48,161 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1447425666, now seen corresponding path program 1 times [2020-10-15 22:03:48,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753059748] [2020-10-15 22:03:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:48,280 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-15 22:03:48,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753059748] [2020-10-15 22:03:48,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:48,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:48,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399280976] [2020-10-15 22:03:48,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:48,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:48,284 INFO L87 Difference]: Start difference. First operand 141 states and 326 transitions. Second operand 5 states. [2020-10-15 22:03:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:48,361 INFO L93 Difference]: Finished difference Result 141 states and 314 transitions. [2020-10-15 22:03:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:48,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-15 22:03:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:48,365 INFO L225 Difference]: With dead ends: 141 [2020-10-15 22:03:48,365 INFO L226 Difference]: Without dead ends: 141 [2020-10-15 22:03:48,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-15 22:03:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-15 22:03:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-15 22:03:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 314 transitions. [2020-10-15 22:03:48,377 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 314 transitions. Word has length 9 [2020-10-15 22:03:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:48,378 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 314 transitions. [2020-10-15 22:03:48,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 314 transitions. [2020-10-15 22:03:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:03:48,379 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:48,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:48,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:03:48,380 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:48,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:48,380 INFO L82 PathProgramCache]: Analyzing trace with hash -975752067, now seen corresponding path program 1 times [2020-10-15 22:03:48,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721695665] [2020-10-15 22:03:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:48,476 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-15 22:03:48,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721695665] [2020-10-15 22:03:48,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:48,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:48,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613883984] [2020-10-15 22:03:48,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:48,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:48,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:48,478 INFO L87 Difference]: Start difference. First operand 141 states and 314 transitions. Second operand 5 states. [2020-10-15 22:03:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:48,526 INFO L93 Difference]: Finished difference Result 156 states and 347 transitions. [2020-10-15 22:03:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:48,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 22:03:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:48,528 INFO L225 Difference]: With dead ends: 156 [2020-10-15 22:03:48,528 INFO L226 Difference]: Without dead ends: 156 [2020-10-15 22:03:48,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-10-15 22:03:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2020-10-15 22:03:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-15 22:03:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 293 transitions. [2020-10-15 22:03:48,537 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 293 transitions. Word has length 12 [2020-10-15 22:03:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:48,538 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 293 transitions. [2020-10-15 22:03:48,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 293 transitions. [2020-10-15 22:03:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:03:48,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:48,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:48,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:03:48,540 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1214858387, now seen corresponding path program 1 times [2020-10-15 22:03:48,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304425488] [2020-10-15 22:03:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:48,594 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-15 22:03:48,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304425488] [2020-10-15 22:03:48,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:48,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:03:48,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899867004] [2020-10-15 22:03:48,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:48,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:48,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:48,597 INFO L87 Difference]: Start difference. First operand 129 states and 293 transitions. Second operand 3 states. [2020-10-15 22:03:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:48,617 INFO L93 Difference]: Finished difference Result 189 states and 426 transitions. [2020-10-15 22:03:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:48,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 22:03:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:48,619 INFO L225 Difference]: With dead ends: 189 [2020-10-15 22:03:48,619 INFO L226 Difference]: Without dead ends: 97 [2020-10-15 22:03:48,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-15 22:03:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-15 22:03:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-15 22:03:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 213 transitions. [2020-10-15 22:03:48,624 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 213 transitions. Word has length 12 [2020-10-15 22:03:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:48,624 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 213 transitions. [2020-10-15 22:03:48,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 213 transitions. [2020-10-15 22:03:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:03:48,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:48,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:48,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:03:48,626 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash 608633669, now seen corresponding path program 2 times [2020-10-15 22:03:48,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246598273] [2020-10-15 22:03:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:48,722 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-15 22:03:48,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246598273] [2020-10-15 22:03:48,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:48,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:48,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8532613] [2020-10-15 22:03:48,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:48,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:48,724 INFO L87 Difference]: Start difference. First operand 97 states and 213 transitions. Second operand 5 states. [2020-10-15 22:03:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:48,789 INFO L93 Difference]: Finished difference Result 95 states and 207 transitions. [2020-10-15 22:03:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:48,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 22:03:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:48,791 INFO L225 Difference]: With dead ends: 95 [2020-10-15 22:03:48,791 INFO L226 Difference]: Without dead ends: 95 [2020-10-15 22:03:48,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-15 22:03:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-15 22:03:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-15 22:03:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 207 transitions. [2020-10-15 22:03:48,795 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 207 transitions. Word has length 12 [2020-10-15 22:03:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:48,795 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 207 transitions. [2020-10-15 22:03:48,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 207 transitions. [2020-10-15 22:03:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:03:48,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:48,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:48,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:03:48,797 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1687741796, now seen corresponding path program 1 times [2020-10-15 22:03:48,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81657633] [2020-10-15 22:03:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:48,883 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-15 22:03:48,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81657633] [2020-10-15 22:03:48,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:48,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:48,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315728704] [2020-10-15 22:03:48,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:03:48,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:03:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:03:48,885 INFO L87 Difference]: Start difference. First operand 95 states and 207 transitions. Second operand 4 states. [2020-10-15 22:03:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:48,917 INFO L93 Difference]: Finished difference Result 82 states and 151 transitions. [2020-10-15 22:03:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:48,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 22:03:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:48,920 INFO L225 Difference]: With dead ends: 82 [2020-10-15 22:03:48,920 INFO L226 Difference]: Without dead ends: 55 [2020-10-15 22:03:48,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-15 22:03:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-15 22:03:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-15 22:03:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2020-10-15 22:03:48,924 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 13 [2020-10-15 22:03:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:48,925 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2020-10-15 22:03:48,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:03:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2020-10-15 22:03:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:03:48,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:48,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:48,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:03:48,926 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1727981485, now seen corresponding path program 1 times [2020-10-15 22:03:48,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:48,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788163344] [2020-10-15 22:03:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:49,021 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-15 22:03:49,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788163344] [2020-10-15 22:03:49,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:49,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:03:49,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452527090] [2020-10-15 22:03:49,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:49,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:49,023 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 5 states. [2020-10-15 22:03:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:49,056 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2020-10-15 22:03:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:03:49,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 22:03:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:49,057 INFO L225 Difference]: With dead ends: 43 [2020-10-15 22:03:49,057 INFO L226 Difference]: Without dead ends: 34 [2020-10-15 22:03:49,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-15 22:03:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-15 22:03:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-15 22:03:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2020-10-15 22:03:49,059 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 14 [2020-10-15 22:03:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:49,060 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2020-10-15 22:03:49,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-10-15 22:03:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:03:49,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:49,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:49,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:03:49,061 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1918077124, now seen corresponding path program 1 times [2020-10-15 22:03:49,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:49,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016856717] [2020-10-15 22:03:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:49,192 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-15 22:03:49,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016856717] [2020-10-15 22:03:49,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:49,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:03:49,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016966208] [2020-10-15 22:03:49,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:03:49,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:49,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:03:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:03:49,195 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 7 states. [2020-10-15 22:03:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:49,325 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-10-15 22:03:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:03:49,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 22:03:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:49,327 INFO L225 Difference]: With dead ends: 42 [2020-10-15 22:03:49,327 INFO L226 Difference]: Without dead ends: 30 [2020-10-15 22:03:49,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:03:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-15 22:03:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-15 22:03:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-15 22:03:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-10-15 22:03:49,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 17 [2020-10-15 22:03:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:49,330 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-10-15 22:03:49,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:03:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-10-15 22:03:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:03:49,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:49,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:49,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:03:49,331 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 483918532, now seen corresponding path program 2 times [2020-10-15 22:03:49,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:49,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822154514] [2020-10-15 22:03:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:03:49,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:03:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:03:49,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:03:49,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:03:49,441 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:03:49,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:03:49,442 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:03:49,450 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L2-->L803: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In-896637269 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-896637269 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-896637269 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-896637269 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_Out-896637269 ~x$r_buff1_thd0~0_In-896637269) (or (and (= ~x$w_buff1_used~0_In-896637269 ~x$w_buff1_used~0_Out-896637269) .cse0) (and .cse1 .cse2 (= ~x$w_buff1_used~0_Out-896637269 0))) (or (and (or (and .cse0 (= ~x~0_In-896637269 ~x~0_Out-896637269)) (and .cse1 .cse2 (= ~x~0_Out-896637269 ~x$w_buff1~0_In-896637269))) .cse3) (and .cse4 .cse5 (= ~x$w_buff0~0_In-896637269 ~x~0_Out-896637269))) (= ~x$r_buff0_thd0~0_Out-896637269 ~x$r_buff0_thd0~0_In-896637269) (or (and .cse4 (= ~x$w_buff0_used~0_Out-896637269 0) .cse5) (and (= ~x$w_buff0_used~0_In-896637269 ~x$w_buff0_used~0_Out-896637269) .cse3)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-896637269 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-896637269|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-896637269 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-896637269, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-896637269, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-896637269|, ~x$w_buff1~0=~x$w_buff1~0_In-896637269, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896637269, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-896637269, ~x~0=~x~0_In-896637269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-896637269} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-896637269, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-896637269, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-896637269|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-896637269|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-896637269|, ~x$w_buff1~0=~x$w_buff1~0_In-896637269, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-896637269, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-896637269|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-896637269, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-896637269|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-896637269|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-896637269, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-896637269|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-896637269, ~x~0=~x~0_Out-896637269} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-15 22:03:49,455 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-15 22:03:49,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,457 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-15 22:03:49,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,457 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-15 22:03:49,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,457 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-15 22:03:49,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,458 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-15 22:03:49,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,458 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-15 22:03:49,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,459 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-15 22:03:49,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,459 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-15 22:03:49,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,460 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-15 22:03:49,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,460 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-15 22:03:49,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,460 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-15 22:03:49,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,461 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-15 22:03:49,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,461 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-15 22:03:49,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,462 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-15 22:03:49,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,462 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-15 22:03:49,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,463 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-15 22:03:49,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,463 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-15 22:03:49,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,463 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-15 22:03:49,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,464 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-15 22:03:49,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,464 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-15 22:03:49,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,464 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-15 22:03:49,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,465 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-15 22:03:49,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,465 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-15 22:03:49,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,465 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-15 22:03:49,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,466 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-15 22:03:49,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,466 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-15 22:03:49,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:49,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:03:49 BasicIcfg [2020-10-15 22:03:49,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:03:49,539 INFO L168 Benchmark]: Toolchain (without parser) took 15264.64 ms. Allocated memory was 251.7 MB in the beginning and 544.2 MB in the end (delta: 292.6 MB). Free memory was 207.4 MB in the beginning and 247.3 MB in the end (delta: -39.9 MB). Peak memory consumption was 252.7 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,542 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.87 ms. Allocated memory was 251.7 MB in the beginning and 314.6 MB in the end (delta: 62.9 MB). Free memory was 207.4 MB in the beginning and 263.6 MB in the end (delta: -56.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.51 ms. Allocated memory is still 314.6 MB. Free memory was 263.6 MB in the beginning and 261.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,546 INFO L168 Benchmark]: Boogie Preprocessor took 38.27 ms. Allocated memory is still 314.6 MB. Free memory was 261.0 MB in the beginning and 258.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,547 INFO L168 Benchmark]: RCFGBuilder took 1978.59 ms. Allocated memory was 314.6 MB in the beginning and 358.1 MB in the end (delta: 43.5 MB). Free memory was 258.5 MB in the beginning and 213.1 MB in the end (delta: 45.4 MB). Peak memory consumption was 98.0 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,548 INFO L168 Benchmark]: TraceAbstraction took 12453.63 ms. Allocated memory was 358.1 MB in the beginning and 544.2 MB in the end (delta: 186.1 MB). Free memory was 210.9 MB in the beginning and 247.3 MB in the end (delta: -36.3 MB). Peak memory consumption was 149.8 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:49,558 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 723.87 ms. Allocated memory was 251.7 MB in the beginning and 314.6 MB in the end (delta: 62.9 MB). Free memory was 207.4 MB in the beginning and 263.6 MB in the end (delta: -56.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.51 ms. Allocated memory is still 314.6 MB. Free memory was 263.6 MB in the beginning and 261.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.27 ms. Allocated memory is still 314.6 MB. Free memory was 261.0 MB in the beginning and 258.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1978.59 ms. Allocated memory was 314.6 MB in the beginning and 358.1 MB in the end (delta: 43.5 MB). Free memory was 258.5 MB in the beginning and 213.1 MB in the end (delta: 45.4 MB). Peak memory consumption was 98.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12453.63 ms. Allocated memory was 358.1 MB in the beginning and 544.2 MB in the end (delta: 186.1 MB). Free memory was 210.9 MB in the beginning and 247.3 MB in the end (delta: -36.3 MB). Peak memory consumption was 149.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 635 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 83 PlacesBefore, 28 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 3022 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L706] 0 _Bool x$flush_delayed; [L707] 0 int x$mem_tmp; [L708] 0 _Bool x$r_buff0_thd0; [L709] 0 _Bool x$r_buff0_thd1; [L710] 0 _Bool x$r_buff0_thd2; [L711] 0 _Bool x$r_buff1_thd0; [L712] 0 _Bool x$r_buff1_thd1; [L713] 0 _Bool x$r_buff1_thd2; [L714] 0 _Bool x$read_delayed; [L715] 0 int *x$read_delayed_var; [L716] 0 int x$w_buff0; [L717] 0 _Bool x$w_buff0_used; [L718] 0 int x$w_buff1; [L719] 0 _Bool x$w_buff1_used; [L721] 0 int y = 0; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L789] 0 pthread_t t1587; [L790] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t1588; [L792] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$w_buff1 = x$w_buff0 [L748] 2 x$w_buff0 = 2 [L749] 2 x$w_buff1_used = x$w_buff0_used [L750] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L737] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L805] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 0 x$flush_delayed = weak$$choice2 [L808] 0 x$mem_tmp = x [L809] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L809] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L810] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L815] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L817] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L817] 0 x = x$flush_delayed ? x$mem_tmp : x [L818] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 162 SDtfs, 139 SDslu, 196 SDs, 0 SdLazy, 182 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 8484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...