/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:00:03,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:00:03,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:00:03,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:00:03,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:00:03,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:00:03,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:00:03,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:00:03,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:00:03,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:00:03,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:00:03,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:00:03,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:00:03,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:00:03,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:00:03,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:00:03,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:00:03,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:00:03,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:00:03,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:00:03,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:00:03,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:00:03,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:00:03,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:00:03,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:00:03,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:00:03,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:00:03,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:00:03,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:00:03,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:00:03,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:00:03,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:00:03,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:00:03,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:00:03,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:00:03,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:00:03,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:00:03,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:00:03,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:00:03,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:00:03,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:00:03,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 22:00:03,563 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:00:03,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:00:03,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:00:03,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:00:03,566 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:00:03,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:00:03,568 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:00:03,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:00:03,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:00:03,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:00:03,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:00:03,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:00:03,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:00:03,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:00:03,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:00:03,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:00:03,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:00:03,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:00:03,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:00:03,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:00:03,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:00:03,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:00:03,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:00:03,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 22:00:03,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:00:03,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:00:03,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:00:03,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:00:03,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 22:00:03,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 22:00:03,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:00:03,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:00:03,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:00:03,923 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:00:03,924 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:00:03,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-21 22:00:04,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec657938e/a77e548ce11f4c8495a5b4e9085597f3/FLAGf9094a76a [2020-10-21 22:00:04,606 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:00:04,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-21 22:00:04,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec657938e/a77e548ce11f4c8495a5b4e9085597f3/FLAGf9094a76a [2020-10-21 22:00:04,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec657938e/a77e548ce11f4c8495a5b4e9085597f3 [2020-10-21 22:00:04,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:00:04,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:00:04,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:00:04,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:00:04,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:00:04,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:00:04" (1/1) ... [2020-10-21 22:00:04,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7254d1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:04, skipping insertion in model container [2020-10-21 22:00:04,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:00:04" (1/1) ... [2020-10-21 22:00:04,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:00:04,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:00:05,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:00:05,598 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:00:05,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:00:05,739 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:00:05,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05 WrapperNode [2020-10-21 22:00:05,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:00:05,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:00:05,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:00:05,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:00:05,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:00:05,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:00:05,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:00:05,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:00:05,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (1/1) ... [2020-10-21 22:00:05,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:00:05,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:00:05,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:00:05,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:00:05,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (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-21 22:00:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:00:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:00:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:00:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:00:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:00:05,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:00:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:00:05,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:00:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:00:05,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:00:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:00:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:00:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:00:05,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:00:05,934 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:00:08,071 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:00:08,071 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:00:08,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:00:08 BoogieIcfgContainer [2020-10-21 22:00:08,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:00:08,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:00:08,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:00:08,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:00:08,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:00:04" (1/3) ... [2020-10-21 22:00:08,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6368d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:00:08, skipping insertion in model container [2020-10-21 22:00:08,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:00:05" (2/3) ... [2020-10-21 22:00:08,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6368d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:00:08, skipping insertion in model container [2020-10-21 22:00:08,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:00:08" (3/3) ... [2020-10-21 22:00:08,084 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2020-10-21 22:00:08,097 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:00:08,098 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:00:08,107 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:00:08,108 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:00:08,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,160 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,160 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,168 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:00:08,172 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:00:08,186 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 22:00:08,210 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:00:08,210 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:00:08,210 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 22:00:08,210 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:00:08,210 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:00:08,211 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:00:08,211 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:00:08,211 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:00:08,226 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 22:00:08,229 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-21 22:00:08,231 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-21 22:00:08,234 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-21 22:00:08,284 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-21 22:00:08,285 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:00:08,290 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-21 22:00:08,294 INFO L116 LiptonReduction]: Number of co-enabled transitions 1862 [2020-10-21 22:00:08,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:08,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:08,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:08,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:08,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:08,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:08,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:08,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:08,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:08,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:08,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:08,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:08,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:08,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:08,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 22:00:08,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,855 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-21 22:00:08,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,860 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-21 22:00:08,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:08,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:08,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:08,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 22:00:08,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:00:08,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 22:00:08,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:00:09,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:09,361 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-21 22:00:09,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:00:09,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:09,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:09,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:09,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 22:00:09,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:00:09,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 22:00:09,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:09,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:09,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:09,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:09,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 22:00:09,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,537 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-21 22:00:09,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-21 22:00:09,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:09,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:09,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:09,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:09,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-21 22:00:09,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:09,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:09,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:09,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:09,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:09,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 22:00:09,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:09,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 22:00:09,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,674 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-21 22:00:09,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,676 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-21 22:00:09,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:09,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:09,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 22:00:09,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:00:09,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 22:00:09,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 22:00:09,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:09,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:00:09,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:00:09,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:00:09,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 22:00:09,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:09,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:09,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:11,278 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 22:00:11,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 22:00:11,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:11,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:00:11,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:12,175 WARN L193 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-21 22:00:12,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:00:12,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:12,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:12,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:12,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:12,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,241 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-21 22:00:13,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:13,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:13,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:13,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:13,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:13,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:13,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:13,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:13,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:13,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:13,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:14,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:14,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:14,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:14,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:14,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:14,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:14,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:14,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:00:14,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:00:14,970 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-21 22:00:15,287 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 22:00:15,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-21 22:00:15,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:00:15,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-21 22:00:15,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:15,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-21 22:00:15,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:15,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-21 22:00:15,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:15,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:15,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:15,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:15,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:00:15,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:15,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:15,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:15,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:15,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-21 22:00:15,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:15,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:15,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:15,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:00:15,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:00:15,744 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-21 22:00:16,496 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 132 [2020-10-21 22:00:16,814 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-21 22:00:17,245 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-21 22:00:17,430 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-21 22:00:17,481 INFO L131 LiptonReduction]: Checked pairs total: 5104 [2020-10-21 22:00:17,481 INFO L133 LiptonReduction]: Total number of compositions: 90 [2020-10-21 22:00:17,489 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-21 22:00:17,550 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-21 22:00:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-21 22:00:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:00:17,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:17,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:00:17,562 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1048842805, now seen corresponding path program 1 times [2020-10-21 22:00:17,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:17,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382070028] [2020-10-21 22:00:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:17,850 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-21 22:00:17,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382070028] [2020-10-21 22:00:17,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:17,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:00:17,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732854481] [2020-10-21 22:00:17,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:00:17,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:00:17,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:00:17,884 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-21 22:00:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:17,995 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-21 22:00:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:00:17,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:00:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:18,021 INFO L225 Difference]: With dead ends: 687 [2020-10-21 22:00:18,021 INFO L226 Difference]: Without dead ends: 562 [2020-10-21 22:00:18,023 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-21 22:00:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-21 22:00:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-21 22:00:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-21 22:00:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-21 22:00:18,127 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-21 22:00:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:18,127 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-21 22:00:18,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:00:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-21 22:00:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:00:18,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:18,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:18,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:00:18,130 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1612320360, now seen corresponding path program 1 times [2020-10-21 22:00:18,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:18,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107896224] [2020-10-21 22:00:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:18,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-21 22:00:18,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107896224] [2020-10-21 22:00:18,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:18,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:00:18,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126431475] [2020-10-21 22:00:18,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:00:18,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:18,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:00:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:00:18,283 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-10-21 22:00:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:18,374 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-21 22:00:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:00:18,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-21 22:00:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:18,382 INFO L225 Difference]: With dead ends: 552 [2020-10-21 22:00:18,382 INFO L226 Difference]: Without dead ends: 552 [2020-10-21 22:00:18,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:00:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-21 22:00:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-21 22:00:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-21 22:00:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-21 22:00:18,410 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-21 22:00:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:18,411 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-21 22:00:18,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:00:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-21 22:00:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 22:00:18,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:18,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:18,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:00:18,414 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1557278652, now seen corresponding path program 1 times [2020-10-21 22:00:18,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:18,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121371381] [2020-10-21 22:00:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:18,501 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-21 22:00:18,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121371381] [2020-10-21 22:00:18,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:18,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:00:18,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056651999] [2020-10-21 22:00:18,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:00:18,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:00:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:00:18,505 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 4 states. [2020-10-21 22:00:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:18,620 INFO L93 Difference]: Finished difference Result 544 states and 1657 transitions. [2020-10-21 22:00:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:00:18,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 22:00:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:18,626 INFO L225 Difference]: With dead ends: 544 [2020-10-21 22:00:18,626 INFO L226 Difference]: Without dead ends: 544 [2020-10-21 22:00:18,627 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-21 22:00:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-10-21 22:00:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2020-10-21 22:00:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-10-21 22:00:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1657 transitions. [2020-10-21 22:00:18,645 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1657 transitions. Word has length 10 [2020-10-21 22:00:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:18,646 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 1657 transitions. [2020-10-21 22:00:18,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:00:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1657 transitions. [2020-10-21 22:00:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:00:18,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:18,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:18,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:00:18,648 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:18,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1032208930, now seen corresponding path program 1 times [2020-10-21 22:00:18,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:18,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418401013] [2020-10-21 22:00:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:18,774 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-21 22:00:18,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418401013] [2020-10-21 22:00:18,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:18,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:00:18,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568718239] [2020-10-21 22:00:18,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:00:18,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:00:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:00:18,778 INFO L87 Difference]: Start difference. First operand 544 states and 1657 transitions. Second operand 4 states. [2020-10-21 22:00:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:18,868 INFO L93 Difference]: Finished difference Result 525 states and 1590 transitions. [2020-10-21 22:00:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:00:18,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:00:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:18,877 INFO L225 Difference]: With dead ends: 525 [2020-10-21 22:00:18,877 INFO L226 Difference]: Without dead ends: 525 [2020-10-21 22:00:18,877 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-21 22:00:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-10-21 22:00:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2020-10-21 22:00:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2020-10-21 22:00:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1590 transitions. [2020-10-21 22:00:18,894 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1590 transitions. Word has length 11 [2020-10-21 22:00:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:18,894 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 1590 transitions. [2020-10-21 22:00:18,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:00:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1590 transitions. [2020-10-21 22:00:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:00:18,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:18,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:18,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:00:18,897 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1933278227, now seen corresponding path program 1 times [2020-10-21 22:00:18,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:18,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746224006] [2020-10-21 22:00:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:18,947 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-21 22:00:18,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746224006] [2020-10-21 22:00:18,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:18,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:00:18,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514900956] [2020-10-21 22:00:18,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:00:18,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:00:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:00:18,949 INFO L87 Difference]: Start difference. First operand 525 states and 1590 transitions. Second operand 3 states. [2020-10-21 22:00:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:18,969 INFO L93 Difference]: Finished difference Result 765 states and 2230 transitions. [2020-10-21 22:00:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:00:18,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 22:00:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:18,974 INFO L225 Difference]: With dead ends: 765 [2020-10-21 22:00:18,975 INFO L226 Difference]: Without dead ends: 561 [2020-10-21 22:00:18,975 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-21 22:00:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-21 22:00:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 513. [2020-10-21 22:00:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-21 22:00:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1481 transitions. [2020-10-21 22:00:18,991 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1481 transitions. Word has length 12 [2020-10-21 22:00:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:18,992 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1481 transitions. [2020-10-21 22:00:18,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:00:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1481 transitions. [2020-10-21 22:00:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:00:18,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:18,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:18,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:00:18,994 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1882912806, now seen corresponding path program 1 times [2020-10-21 22:00:18,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:18,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917072894] [2020-10-21 22:00:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:19,038 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-21 22:00:19,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917072894] [2020-10-21 22:00:19,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:19,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:00:19,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000203077] [2020-10-21 22:00:19,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:00:19,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:00:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:00:19,041 INFO L87 Difference]: Start difference. First operand 513 states and 1481 transitions. Second operand 4 states. [2020-10-21 22:00:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:19,080 INFO L93 Difference]: Finished difference Result 789 states and 2256 transitions. [2020-10-21 22:00:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:00:19,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 22:00:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:19,085 INFO L225 Difference]: With dead ends: 789 [2020-10-21 22:00:19,085 INFO L226 Difference]: Without dead ends: 489 [2020-10-21 22:00:19,086 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-21 22:00:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-10-21 22:00:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2020-10-21 22:00:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-10-21 22:00:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1393 transitions. [2020-10-21 22:00:19,100 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1393 transitions. Word has length 12 [2020-10-21 22:00:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:19,101 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 1393 transitions. [2020-10-21 22:00:19,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:00:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1393 transitions. [2020-10-21 22:00:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:00:19,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:19,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:19,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:00:19,102 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:19,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1896187626, now seen corresponding path program 2 times [2020-10-21 22:00:19,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:19,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415838050] [2020-10-21 22:00:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:19,144 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-21 22:00:19,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415838050] [2020-10-21 22:00:19,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:19,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:00:19,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168092214] [2020-10-21 22:00:19,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:00:19,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:19,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:00:19,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:00:19,146 INFO L87 Difference]: Start difference. First operand 489 states and 1393 transitions. Second operand 3 states. [2020-10-21 22:00:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:19,156 INFO L93 Difference]: Finished difference Result 473 states and 1337 transitions. [2020-10-21 22:00:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:00:19,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 22:00:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:19,161 INFO L225 Difference]: With dead ends: 473 [2020-10-21 22:00:19,161 INFO L226 Difference]: Without dead ends: 473 [2020-10-21 22:00:19,161 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-21 22:00:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-21 22:00:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2020-10-21 22:00:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-10-21 22:00:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1337 transitions. [2020-10-21 22:00:19,175 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1337 transitions. Word has length 12 [2020-10-21 22:00:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:19,176 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 1337 transitions. [2020-10-21 22:00:19,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:00:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1337 transitions. [2020-10-21 22:00:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:00:19,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:19,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:19,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:00:19,177 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:19,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2015887913, now seen corresponding path program 1 times [2020-10-21 22:00:19,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:19,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080864840] [2020-10-21 22:00:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:19,231 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-21 22:00:19,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080864840] [2020-10-21 22:00:19,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:19,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:00:19,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164499387] [2020-10-21 22:00:19,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:00:19,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:19,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:00:19,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:00:19,234 INFO L87 Difference]: Start difference. First operand 473 states and 1337 transitions. Second operand 5 states. [2020-10-21 22:00:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:19,350 INFO L93 Difference]: Finished difference Result 461 states and 1296 transitions. [2020-10-21 22:00:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:00:19,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:00:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:19,354 INFO L225 Difference]: With dead ends: 461 [2020-10-21 22:00:19,354 INFO L226 Difference]: Without dead ends: 461 [2020-10-21 22:00:19,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:00:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2020-10-21 22:00:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2020-10-21 22:00:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-10-21 22:00:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1296 transitions. [2020-10-21 22:00:19,368 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1296 transitions. Word has length 12 [2020-10-21 22:00:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:19,369 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 1296 transitions. [2020-10-21 22:00:19,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:00:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1296 transitions. [2020-10-21 22:00:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:00:19,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:19,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:19,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:00:19,370 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1347723981, now seen corresponding path program 1 times [2020-10-21 22:00:19,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:19,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674874157] [2020-10-21 22:00:19,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:19,514 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-21 22:00:19,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674874157] [2020-10-21 22:00:19,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:19,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:00:19,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838629084] [2020-10-21 22:00:19,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:00:19,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:00:19,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:00:19,517 INFO L87 Difference]: Start difference. First operand 461 states and 1296 transitions. Second operand 7 states. [2020-10-21 22:00:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:19,724 INFO L93 Difference]: Finished difference Result 519 states and 1459 transitions. [2020-10-21 22:00:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:00:19,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-21 22:00:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:19,728 INFO L225 Difference]: With dead ends: 519 [2020-10-21 22:00:19,728 INFO L226 Difference]: Without dead ends: 519 [2020-10-21 22:00:19,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:00:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-10-21 22:00:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 485. [2020-10-21 22:00:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-21 22:00:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1359 transitions. [2020-10-21 22:00:19,747 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1359 transitions. Word has length 13 [2020-10-21 22:00:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:19,747 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1359 transitions. [2020-10-21 22:00:19,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:00:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1359 transitions. [2020-10-21 22:00:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:00:19,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:19,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:19,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:00:19,749 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1920351067, now seen corresponding path program 2 times [2020-10-21 22:00:19,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:19,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908557393] [2020-10-21 22:00:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:19,867 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-21 22:00:19,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908557393] [2020-10-21 22:00:19,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:19,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:00:19,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613286147] [2020-10-21 22:00:19,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:00:19,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:19,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:00:19,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:00:19,870 INFO L87 Difference]: Start difference. First operand 485 states and 1359 transitions. Second operand 6 states. [2020-10-21 22:00:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:20,026 INFO L93 Difference]: Finished difference Result 621 states and 1738 transitions. [2020-10-21 22:00:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:00:20,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 22:00:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:20,029 INFO L225 Difference]: With dead ends: 621 [2020-10-21 22:00:20,030 INFO L226 Difference]: Without dead ends: 253 [2020-10-21 22:00:20,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:00:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-10-21 22:00:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2020-10-21 22:00:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-21 22:00:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 704 transitions. [2020-10-21 22:00:20,038 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 704 transitions. Word has length 13 [2020-10-21 22:00:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:20,038 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 704 transitions. [2020-10-21 22:00:20,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:00:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 704 transitions. [2020-10-21 22:00:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 22:00:20,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:20,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:20,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:00:20,040 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash 560794003, now seen corresponding path program 1 times [2020-10-21 22:00:20,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:20,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470022127] [2020-10-21 22:00:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:20,107 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-21 22:00:20,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470022127] [2020-10-21 22:00:20,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:20,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:00:20,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119573916] [2020-10-21 22:00:20,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:00:20,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:00:20,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:00:20,109 INFO L87 Difference]: Start difference. First operand 253 states and 704 transitions. Second operand 5 states. [2020-10-21 22:00:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:20,190 INFO L93 Difference]: Finished difference Result 252 states and 700 transitions. [2020-10-21 22:00:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:00:20,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 22:00:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:20,194 INFO L225 Difference]: With dead ends: 252 [2020-10-21 22:00:20,194 INFO L226 Difference]: Without dead ends: 252 [2020-10-21 22:00:20,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:00:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-10-21 22:00:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2020-10-21 22:00:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-10-21 22:00:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 700 transitions. [2020-10-21 22:00:20,204 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 700 transitions. Word has length 14 [2020-10-21 22:00:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:20,204 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 700 transitions. [2020-10-21 22:00:20,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:00:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 700 transitions. [2020-10-21 22:00:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:00:20,206 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:20,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:20,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:00:20,206 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash 950022406, now seen corresponding path program 1 times [2020-10-21 22:00:20,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:20,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23580476] [2020-10-21 22:00:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:20,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-21 22:00:20,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23580476] [2020-10-21 22:00:20,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:20,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:00:20,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228657037] [2020-10-21 22:00:20,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:00:20,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:00:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:00:20,282 INFO L87 Difference]: Start difference. First operand 252 states and 700 transitions. Second operand 4 states. [2020-10-21 22:00:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:20,307 INFO L93 Difference]: Finished difference Result 242 states and 591 transitions. [2020-10-21 22:00:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:00:20,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 22:00:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:20,309 INFO L225 Difference]: With dead ends: 242 [2020-10-21 22:00:20,310 INFO L226 Difference]: Without dead ends: 177 [2020-10-21 22:00:20,310 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-21 22:00:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-21 22:00:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-10-21 22:00:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-21 22:00:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 423 transitions. [2020-10-21 22:00:20,315 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 423 transitions. Word has length 15 [2020-10-21 22:00:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:20,315 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 423 transitions. [2020-10-21 22:00:20,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:00:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 423 transitions. [2020-10-21 22:00:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:00:20,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:20,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:20,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:00:20,317 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash 256502321, now seen corresponding path program 1 times [2020-10-21 22:00:20,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:20,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518810264] [2020-10-21 22:00:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:20,378 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-21 22:00:20,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518810264] [2020-10-21 22:00:20,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:20,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:00:20,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661154093] [2020-10-21 22:00:20,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:00:20,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:00:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:00:20,380 INFO L87 Difference]: Start difference. First operand 177 states and 423 transitions. Second operand 5 states. [2020-10-21 22:00:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:20,422 INFO L93 Difference]: Finished difference Result 144 states and 304 transitions. [2020-10-21 22:00:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:00:20,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 22:00:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:20,424 INFO L225 Difference]: With dead ends: 144 [2020-10-21 22:00:20,424 INFO L226 Difference]: Without dead ends: 107 [2020-10-21 22:00:20,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:00:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-21 22:00:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-21 22:00:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 22:00:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 215 transitions. [2020-10-21 22:00:20,428 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 215 transitions. Word has length 16 [2020-10-21 22:00:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:20,429 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 215 transitions. [2020-10-21 22:00:20,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:00:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 215 transitions. [2020-10-21 22:00:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 22:00:20,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:20,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:20,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:00:20,430 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:20,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1023864462, now seen corresponding path program 1 times [2020-10-21 22:00:20,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:20,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552677947] [2020-10-21 22:00:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:20,509 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-21 22:00:20,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552677947] [2020-10-21 22:00:20,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:20,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:00:20,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939527245] [2020-10-21 22:00:20,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:00:20,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:00:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:00:20,511 INFO L87 Difference]: Start difference. First operand 107 states and 215 transitions. Second operand 6 states. [2020-10-21 22:00:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:20,594 INFO L93 Difference]: Finished difference Result 92 states and 183 transitions. [2020-10-21 22:00:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:00:20,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 22:00:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:20,596 INFO L225 Difference]: With dead ends: 92 [2020-10-21 22:00:20,596 INFO L226 Difference]: Without dead ends: 82 [2020-10-21 22:00:20,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:00:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-21 22:00:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-21 22:00:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-21 22:00:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 165 transitions. [2020-10-21 22:00:20,600 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 165 transitions. Word has length 18 [2020-10-21 22:00:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:20,600 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 165 transitions. [2020-10-21 22:00:20,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:00:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 165 transitions. [2020-10-21 22:00:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 22:00:20,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:20,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:20,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 22:00:20,601 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2015020648, now seen corresponding path program 1 times [2020-10-21 22:00:20,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:20,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244587409] [2020-10-21 22:00:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:20,981 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-21 22:00:20,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244587409] [2020-10-21 22:00:20,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:20,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 22:00:20,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142030321] [2020-10-21 22:00:20,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 22:00:20,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:20,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 22:00:20,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:00:20,983 INFO L87 Difference]: Start difference. First operand 82 states and 165 transitions. Second operand 9 states. [2020-10-21 22:00:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:21,127 INFO L93 Difference]: Finished difference Result 108 states and 213 transitions. [2020-10-21 22:00:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:00:21,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-21 22:00:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:21,129 INFO L225 Difference]: With dead ends: 108 [2020-10-21 22:00:21,129 INFO L226 Difference]: Without dead ends: 86 [2020-10-21 22:00:21,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-21 22:00:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-21 22:00:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2020-10-21 22:00:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-21 22:00:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 141 transitions. [2020-10-21 22:00:21,132 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 141 transitions. Word has length 21 [2020-10-21 22:00:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:21,133 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 141 transitions. [2020-10-21 22:00:21,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 22:00:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 141 transitions. [2020-10-21 22:00:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 22:00:21,133 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:21,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:21,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 22:00:21,134 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1226256408, now seen corresponding path program 2 times [2020-10-21 22:00:21,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:21,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150106379] [2020-10-21 22:00:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:00:21,448 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-21 22:00:21,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150106379] [2020-10-21 22:00:21,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:00:21,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 22:00:21,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721444519] [2020-10-21 22:00:21,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 22:00:21,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:00:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 22:00:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:00:21,450 INFO L87 Difference]: Start difference. First operand 74 states and 141 transitions. Second operand 8 states. [2020-10-21 22:00:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:00:21,547 INFO L93 Difference]: Finished difference Result 100 states and 189 transitions. [2020-10-21 22:00:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:00:21,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-21 22:00:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:00:21,549 INFO L225 Difference]: With dead ends: 100 [2020-10-21 22:00:21,549 INFO L226 Difference]: Without dead ends: 60 [2020-10-21 22:00:21,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:00:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-21 22:00:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-21 22:00:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-21 22:00:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2020-10-21 22:00:21,552 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 21 [2020-10-21 22:00:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:00:21,552 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2020-10-21 22:00:21,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 22:00:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2020-10-21 22:00:21,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 22:00:21,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:00:21,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:00:21,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 22:00:21,553 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:00:21,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:00:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1452915720, now seen corresponding path program 3 times [2020-10-21 22:00:21,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:00:21,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053619004] [2020-10-21 22:00:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:00:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:00:21,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:00:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:00:21,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:00:21,738 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:00:21,739 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:00:21,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 22:00:21,740 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:00:21,754 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In798029992 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In798029992 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In798029992 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In798029992 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and (= ~x~0_Out798029992 ~x$w_buff0~0_In798029992) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~x~0_Out798029992 ~x~0_In798029992)) (and .cse4 (= ~x~0_Out798029992 ~x$w_buff1~0_In798029992) .cse5)))) (= ~x$r_buff0_thd0~0_In798029992 ~x$r_buff0_thd0~0_Out798029992) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out798029992| (mod ~main$tmp_guard0~0_In798029992 256)) (= ~x$r_buff1_thd0~0_In798029992 ~x$r_buff1_thd0~0_Out798029992) (or (and .cse2 (= ~x$w_buff0_used~0_In798029992 ~x$w_buff0_used~0_Out798029992)) (and .cse0 .cse1 (= 0 ~x$w_buff0_used~0_Out798029992))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out798029992| ULTIMATE.start_assume_abort_if_not_~cond_Out798029992) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out798029992 0)) (or (and .cse4 (= ~x$w_buff1_used~0_Out798029992 0) .cse5) (and .cse3 (= ~x$w_buff1_used~0_Out798029992 ~x$w_buff1_used~0_In798029992)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In798029992, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In798029992, ~x$w_buff1~0=~x$w_buff1~0_In798029992, ~x$w_buff1_used~0=~x$w_buff1_used~0_In798029992, ~main$tmp_guard0~0=~main$tmp_guard0~0_In798029992, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In798029992, ~x~0=~x~0_In798029992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In798029992} OutVars{~x$w_buff0~0=~x$w_buff0~0_In798029992, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out798029992, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out798029992|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out798029992|, ~x$w_buff1~0=~x$w_buff1~0_In798029992, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out798029992, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out798029992|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out798029992|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In798029992, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out798029992|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out798029992, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out798029992, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out798029992|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out798029992|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out798029992, ~x~0=~x~0_Out798029992} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-21 22:00:21,766 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-21 22:00:21,767 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-10-21 22:00:21,767 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-21 22:00:21,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,767 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-21 22:00:21,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,768 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-21 22:00:21,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,770 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-21 22:00:21,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,771 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-21 22:00:21,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,771 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-21 22:00:21,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,773 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-21 22:00:21,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,773 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-21 22:00:21,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,773 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-21 22:00:21,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,774 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-21 22:00:21,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,774 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-21 22:00:21,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,775 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-21 22:00:21,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,775 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-21 22:00:21,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,776 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-21 22:00:21,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,776 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-21 22:00:21,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,777 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-21 22:00:21,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,777 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-21 22:00:21,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,779 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-21 22:00:21,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,785 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-21 22:00:21,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,785 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-21 22:00:21,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,786 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-21 22:00:21,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,786 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-21 22:00:21,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,786 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-21 22:00:21,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,786 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-21 22:00:21,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,787 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-21 22:00:21,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,787 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-21 22:00:21,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,787 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-21 22:00:21,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,788 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-21 22:00:21,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,788 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-21 22:00:21,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,788 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-21 22:00:21,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:00:21,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:00:21 BasicIcfg [2020-10-21 22:00:21,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:00:21,870 INFO L168 Benchmark]: Toolchain (without parser) took 16988.39 ms. Allocated memory was 146.3 MB in the beginning and 456.1 MB in the end (delta: 309.9 MB). Free memory was 100.1 MB in the beginning and 242.6 MB in the end (delta: -142.5 MB). Peak memory consumption was 167.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,871 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.43 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 99.3 MB in the beginning and 152.5 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,872 INFO L168 Benchmark]: Boogie Preprocessor took 46.50 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 147.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,873 INFO L168 Benchmark]: RCFGBuilder took 2216.06 ms. Allocated memory was 202.4 MB in the beginning and 251.1 MB in the end (delta: 48.8 MB). Free memory was 147.0 MB in the beginning and 163.3 MB in the end (delta: -16.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,874 INFO L168 Benchmark]: TraceAbstraction took 13793.02 ms. Allocated memory was 251.1 MB in the beginning and 456.1 MB in the end (delta: 205.0 MB). Free memory was 163.3 MB in the beginning and 242.6 MB in the end (delta: -79.3 MB). Peak memory consumption was 125.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:00:21,877 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.43 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 99.3 MB in the beginning and 152.5 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.50 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 147.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2216.06 ms. Allocated memory was 202.4 MB in the beginning and 251.1 MB in the end (delta: 48.8 MB). Free memory was 147.0 MB in the beginning and 163.3 MB in the end (delta: -16.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13793.02 ms. Allocated memory was 251.1 MB in the beginning and 456.1 MB in the end (delta: 205.0 MB). Free memory was 163.3 MB in the beginning and 242.6 MB in the end (delta: -79.3 MB). Peak memory consumption was 125.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1321 VarBasedMoverChecksPositive, 87 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 123 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.2s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 5104 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1888; [L819] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t1889; [L821] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1890; [L823] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L741] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L776] 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) [L776] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] EXPR 0 !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) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 !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) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe004_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 325 SDtfs, 423 SDslu, 515 SDs, 0 SdLazy, 442 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 94 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 27201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...