/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:37:44,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:37:44,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:37:44,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:37:44,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:37:44,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:37:44,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:37:44,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:37:44,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:37:44,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:37:44,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:37:44,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:37:44,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:37:44,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:37:44,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:37:44,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:37:44,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:37:44,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:37:44,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:37:44,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:37:44,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:37:44,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:37:44,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:37:44,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:37:44,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:37:44,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:37:44,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:37:44,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:37:44,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:37:44,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:37:44,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:37:44,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:37:44,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:37:44,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:37:44,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:37:44,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:37:44,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:37:44,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:37:44,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:37:44,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:37:44,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:37:44,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:37:44,881 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:37:44,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:37:44,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:37:44,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:37:44,883 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:37:44,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:37:44,883 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:37:44,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:37:44,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:37:44,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:37:44,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:37:44,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:37:44,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:37:44,885 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:37:44,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:37:44,885 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:37:44,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:37:44,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:37:44,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:37:44,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:37:44,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:37:44,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:37:44,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:37:44,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:37:44,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:37:44,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:37:44,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:37:44,888 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:37:44,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:37:45,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:37:45,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:37:45,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:37:45,224 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:37:45,225 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:37:45,225 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2020-10-05 23:37:45,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a952685a/bdb7ec8cdd7c4f4fac8fb8168a51af80/FLAG1b38d42ae [2020-10-05 23:37:45,842 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:37:45,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2020-10-05 23:37:45,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a952685a/bdb7ec8cdd7c4f4fac8fb8168a51af80/FLAG1b38d42ae [2020-10-05 23:37:46,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a952685a/bdb7ec8cdd7c4f4fac8fb8168a51af80 [2020-10-05 23:37:46,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:37:46,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:37:46,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:37:46,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:37:46,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:37:46,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3f0c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46, skipping insertion in model container [2020-10-05 23:37:46,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:37:46,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:37:46,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:37:46,679 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:37:46,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:37:46,859 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:37:46,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46 WrapperNode [2020-10-05 23:37:46,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:37:46,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:37:46,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:37:46,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:37:46,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:37:46,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:37:46,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:37:46,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:37:46,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... [2020-10-05 23:37:46,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:37:46,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:37:46,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:37:46,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:37:46,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:37:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:37:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:37:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:37:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:37:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:37:47,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:37:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:37:47,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:37:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:37:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:37:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:37:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:37:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:37:47,057 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:37:49,066 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:37:49,066 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:37:49,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:37:49 BoogieIcfgContainer [2020-10-05 23:37:49,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:37:49,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:37:49,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:37:49,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:37:49,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:37:46" (1/3) ... [2020-10-05 23:37:49,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d19007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:37:49, skipping insertion in model container [2020-10-05 23:37:49,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:37:46" (2/3) ... [2020-10-05 23:37:49,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d19007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:37:49, skipping insertion in model container [2020-10-05 23:37:49,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:37:49" (3/3) ... [2020-10-05 23:37:49,078 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_rmo.opt.i [2020-10-05 23:37:49,089 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:37:49,090 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:37:49,098 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:37:49,099 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:37:49,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,137 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,148 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,149 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,156 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,156 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:37:49,179 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:37:49,203 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:37:49,203 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:37:49,203 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:37:49,203 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:37:49,204 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:37:49,204 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:37:49,204 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:37:49,204 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:37:49,222 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-05 23:37:49,224 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:37:49,271 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:37:49,271 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:37:49,277 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:37:49,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:37:49,302 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:37:49,302 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:37:49,303 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:37:49,305 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1642 [2020-10-05 23:37:49,306 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:37:50,748 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-05 23:37:50,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-05 23:37:50,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:37:50,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:37:50,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:37:51,962 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-05 23:37:52,916 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:37:53,574 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:37:53,942 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:37:54,856 WARN L193 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-05 23:37:55,155 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-05 23:37:56,428 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-05 23:37:56,739 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-05 23:37:57,202 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:37:57,539 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:37:57,800 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 23:37:57,914 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:37:57,933 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4410 [2020-10-05 23:37:57,934 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-10-05 23:37:57,937 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:37:58,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-05 23:37:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-05 23:37:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:37:58,035 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:37:58,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:37:58,037 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:37:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:37:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times [2020-10-05 23:37:58,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:37:58,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412922898] [2020-10-05 23:37:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:37:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:37:58,311 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-05 23:37:58,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412922898] [2020-10-05 23:37:58,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:37:58,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:37:58,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293809682] [2020-10-05 23:37:58,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:37:58,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:37:58,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:37:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:37:58,337 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-05 23:37:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:37:58,452 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-05 23:37:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:37:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:37:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:37:58,478 INFO L225 Difference]: With dead ends: 687 [2020-10-05 23:37:58,478 INFO L226 Difference]: Without dead ends: 562 [2020-10-05 23:37:58,479 INFO L675 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-05 23:37:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-05 23:37:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-05 23:37:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-05 23:37:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-05 23:37:58,612 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-05 23:37:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:37:58,613 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-05 23:37:58,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:37:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-05 23:37:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:37:58,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:37:58,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:37:58,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:37:58,617 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:37:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:37:58,618 INFO L82 PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times [2020-10-05 23:37:58,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:37:58,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238780605] [2020-10-05 23:37:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:37:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:37:58,735 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-05 23:37:58,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238780605] [2020-10-05 23:37:58,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:37:58,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:37:58,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791141387] [2020-10-05 23:37:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:37:58,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:37:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:37:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:37:58,739 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-05 23:37:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:37:58,786 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-05 23:37:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:37:58,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:37:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:37:58,793 INFO L225 Difference]: With dead ends: 552 [2020-10-05 23:37:58,793 INFO L226 Difference]: Without dead ends: 552 [2020-10-05 23:37:58,794 INFO L675 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-05 23:37:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-05 23:37:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-05 23:37:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-05 23:37:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-05 23:37:58,832 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-05 23:37:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:37:58,833 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-05 23:37:58,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:37:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-05 23:37:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:37:58,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:37:58,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:37:58,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:37:58,836 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:37:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:37:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2146239772, now seen corresponding path program 1 times [2020-10-05 23:37:58,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:37:58,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909168027] [2020-10-05 23:37:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:37:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:37:58,988 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-05 23:37:58,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909168027] [2020-10-05 23:37:58,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:37:58,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:37:58,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894631242] [2020-10-05 23:37:58,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:37:58,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:37:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:37:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:37:58,991 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-05 23:37:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:37:59,027 INFO L93 Difference]: Finished difference Result 542 states and 1649 transitions. [2020-10-05 23:37:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:37:59,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:37:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:37:59,033 INFO L225 Difference]: With dead ends: 542 [2020-10-05 23:37:59,033 INFO L226 Difference]: Without dead ends: 542 [2020-10-05 23:37:59,034 INFO L675 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-05 23:37:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-10-05 23:37:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2020-10-05 23:37:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-10-05 23:37:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1649 transitions. [2020-10-05 23:37:59,057 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1649 transitions. Word has length 10 [2020-10-05 23:37:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:37:59,058 INFO L479 AbstractCegarLoop]: Abstraction has 542 states and 1649 transitions. [2020-10-05 23:37:59,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:37:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1649 transitions. [2020-10-05 23:37:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:37:59,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:37:59,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:37:59,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:37:59,071 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:37:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:37:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2094870650, now seen corresponding path program 1 times [2020-10-05 23:37:59,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:37:59,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025050945] [2020-10-05 23:37:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:37:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:37:59,153 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-05 23:37:59,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025050945] [2020-10-05 23:37:59,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:37:59,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:37:59,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856260516] [2020-10-05 23:37:59,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:37:59,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:37:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:37:59,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:37:59,156 INFO L87 Difference]: Start difference. First operand 542 states and 1649 transitions. Second operand 4 states. [2020-10-05 23:37:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:37:59,230 INFO L93 Difference]: Finished difference Result 521 states and 1575 transitions. [2020-10-05 23:37:59,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:37:59,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:37:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:37:59,240 INFO L225 Difference]: With dead ends: 521 [2020-10-05 23:37:59,240 INFO L226 Difference]: Without dead ends: 521 [2020-10-05 23:37:59,241 INFO L675 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-05 23:37:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-05 23:37:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2020-10-05 23:37:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-10-05 23:37:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1575 transitions. [2020-10-05 23:37:59,258 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1575 transitions. Word has length 11 [2020-10-05 23:37:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:37:59,259 INFO L479 AbstractCegarLoop]: Abstraction has 521 states and 1575 transitions. [2020-10-05 23:37:59,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:37:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1575 transitions. [2020-10-05 23:37:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:37:59,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:37:59,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:37:59,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:37:59,262 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:37:59,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:37:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1669512842, now seen corresponding path program 1 times [2020-10-05 23:37:59,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:37:59,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136295638] [2020-10-05 23:37:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:37:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:37:59,402 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-05 23:37:59,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136295638] [2020-10-05 23:37:59,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:37:59,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:37:59,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244222160] [2020-10-05 23:37:59,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:37:59,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:37:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:37:59,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:37:59,405 INFO L87 Difference]: Start difference. First operand 521 states and 1575 transitions. Second operand 5 states. [2020-10-05 23:37:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:37:59,525 INFO L93 Difference]: Finished difference Result 829 states and 2478 transitions. [2020-10-05 23:37:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:37:59,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:37:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:37:59,530 INFO L225 Difference]: With dead ends: 829 [2020-10-05 23:37:59,531 INFO L226 Difference]: Without dead ends: 481 [2020-10-05 23:37:59,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:37:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-10-05 23:37:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2020-10-05 23:37:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-10-05 23:37:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1447 transitions. [2020-10-05 23:37:59,548 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1447 transitions. Word has length 12 [2020-10-05 23:37:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:37:59,548 INFO L479 AbstractCegarLoop]: Abstraction has 481 states and 1447 transitions. [2020-10-05 23:37:59,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:37:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1447 transitions. [2020-10-05 23:37:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:37:59,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:37:59,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:37:59,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:37:59,550 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:37:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:37:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 522745330, now seen corresponding path program 2 times [2020-10-05 23:37:59,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:37:59,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066371042] [2020-10-05 23:37:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:37:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:37:59,689 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-05 23:37:59,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066371042] [2020-10-05 23:37:59,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:37:59,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:37:59,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436459044] [2020-10-05 23:37:59,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:37:59,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:37:59,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:37:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:37:59,691 INFO L87 Difference]: Start difference. First operand 481 states and 1447 transitions. Second operand 7 states. [2020-10-05 23:37:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:37:59,965 INFO L93 Difference]: Finished difference Result 524 states and 1587 transitions. [2020-10-05 23:37:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:37:59,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-05 23:37:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:37:59,973 INFO L225 Difference]: With dead ends: 524 [2020-10-05 23:37:59,973 INFO L226 Difference]: Without dead ends: 524 [2020-10-05 23:37:59,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:37:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-10-05 23:37:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 498. [2020-10-05 23:37:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-10-05 23:38:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1496 transitions. [2020-10-05 23:38:00,001 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1496 transitions. Word has length 12 [2020-10-05 23:38:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,001 INFO L479 AbstractCegarLoop]: Abstraction has 498 states and 1496 transitions. [2020-10-05 23:38:00,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:38:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1496 transitions. [2020-10-05 23:38:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:38:00,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:00,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:38:00,003 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1569711505, now seen corresponding path program 1 times [2020-10-05 23:38:00,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696856447] [2020-10-05 23:38:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:00,065 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-05 23:38:00,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696856447] [2020-10-05 23:38:00,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:00,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:00,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864662009] [2020-10-05 23:38:00,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:00,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:00,068 INFO L87 Difference]: Start difference. First operand 498 states and 1496 transitions. Second operand 4 states. [2020-10-05 23:38:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:00,186 INFO L93 Difference]: Finished difference Result 962 states and 2760 transitions. [2020-10-05 23:38:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:00,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:38:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:00,192 INFO L225 Difference]: With dead ends: 962 [2020-10-05 23:38:00,192 INFO L226 Difference]: Without dead ends: 497 [2020-10-05 23:38:00,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 23:38:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-05 23:38:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 464. [2020-10-05 23:38:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-05 23:38:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1303 transitions. [2020-10-05 23:38:00,208 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1303 transitions. Word has length 13 [2020-10-05 23:38:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,209 INFO L479 AbstractCegarLoop]: Abstraction has 464 states and 1303 transitions. [2020-10-05 23:38:00,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1303 transitions. [2020-10-05 23:38:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:38:00,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:00,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:38:00,211 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1053797076, now seen corresponding path program 1 times [2020-10-05 23:38:00,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320663874] [2020-10-05 23:38:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:00,266 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-05 23:38:00,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320663874] [2020-10-05 23:38:00,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:00,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:38:00,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597904523] [2020-10-05 23:38:00,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:00,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:00,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:00,268 INFO L87 Difference]: Start difference. First operand 464 states and 1303 transitions. Second operand 4 states. [2020-10-05 23:38:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:00,338 INFO L93 Difference]: Finished difference Result 455 states and 1273 transitions. [2020-10-05 23:38:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:38:00,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:38:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:00,343 INFO L225 Difference]: With dead ends: 455 [2020-10-05 23:38:00,344 INFO L226 Difference]: Without dead ends: 455 [2020-10-05 23:38:00,344 INFO L675 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-05 23:38:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-10-05 23:38:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2020-10-05 23:38:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-05 23:38:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1273 transitions. [2020-10-05 23:38:00,358 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1273 transitions. Word has length 13 [2020-10-05 23:38:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,358 INFO L479 AbstractCegarLoop]: Abstraction has 455 states and 1273 transitions. [2020-10-05 23:38:00,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1273 transitions. [2020-10-05 23:38:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:38:00,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:00,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:38:00,360 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1321098170, now seen corresponding path program 1 times [2020-10-05 23:38:00,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276929354] [2020-10-05 23:38:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:00,418 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-05 23:38:00,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276929354] [2020-10-05 23:38:00,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:00,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:00,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827928583] [2020-10-05 23:38:00,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:38:00,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:00,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:38:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:00,420 INFO L87 Difference]: Start difference. First operand 455 states and 1273 transitions. Second operand 5 states. [2020-10-05 23:38:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:00,512 INFO L93 Difference]: Finished difference Result 608 states and 1666 transitions. [2020-10-05 23:38:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:00,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:38:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:00,519 INFO L225 Difference]: With dead ends: 608 [2020-10-05 23:38:00,519 INFO L226 Difference]: Without dead ends: 336 [2020-10-05 23:38:00,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:38:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-10-05 23:38:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2020-10-05 23:38:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-10-05 23:38:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 881 transitions. [2020-10-05 23:38:00,530 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 881 transitions. Word has length 14 [2020-10-05 23:38:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,530 INFO L479 AbstractCegarLoop]: Abstraction has 327 states and 881 transitions. [2020-10-05 23:38:00,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:38:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 881 transitions. [2020-10-05 23:38:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:38:00,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:00,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:38:00,531 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash 156465154, now seen corresponding path program 2 times [2020-10-05 23:38:00,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230250788] [2020-10-05 23:38:00,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:00,626 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-05 23:38:00,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230250788] [2020-10-05 23:38:00,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:00,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:38:00,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925218861] [2020-10-05 23:38:00,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:00,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:00,628 INFO L87 Difference]: Start difference. First operand 327 states and 881 transitions. Second operand 4 states. [2020-10-05 23:38:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:00,671 INFO L93 Difference]: Finished difference Result 460 states and 1243 transitions. [2020-10-05 23:38:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:38:00,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:38:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:00,675 INFO L225 Difference]: With dead ends: 460 [2020-10-05 23:38:00,675 INFO L226 Difference]: Without dead ends: 208 [2020-10-05 23:38:00,675 INFO L675 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-05 23:38:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-05 23:38:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2020-10-05 23:38:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-05 23:38:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 559 transitions. [2020-10-05 23:38:00,687 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 559 transitions. Word has length 14 [2020-10-05 23:38:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,688 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 559 transitions. [2020-10-05 23:38:00,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 559 transitions. [2020-10-05 23:38:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:38:00,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:00,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:38:00,690 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times [2020-10-05 23:38:00,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204213041] [2020-10-05 23:38:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:00,768 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-05 23:38:00,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204213041] [2020-10-05 23:38:00,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:00,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:00,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413364172] [2020-10-05 23:38:00,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:00,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:00,771 INFO L87 Difference]: Start difference. First operand 208 states and 559 transitions. Second operand 4 states. [2020-10-05 23:38:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:00,796 INFO L93 Difference]: Finished difference Result 206 states and 485 transitions. [2020-10-05 23:38:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:00,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:38:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:00,797 INFO L225 Difference]: With dead ends: 206 [2020-10-05 23:38:00,798 INFO L226 Difference]: Without dead ends: 153 [2020-10-05 23:38:00,798 INFO L675 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-05 23:38:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-05 23:38:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-10-05 23:38:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:38:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 355 transitions. [2020-10-05 23:38:00,801 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 355 transitions. Word has length 15 [2020-10-05 23:38:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,802 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 355 transitions. [2020-10-05 23:38:00,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 355 transitions. [2020-10-05 23:38:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:38:00,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:00,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:38:00,803 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2130702573, now seen corresponding path program 1 times [2020-10-05 23:38:00,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963395612] [2020-10-05 23:38:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:00,878 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-05 23:38:00,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963395612] [2020-10-05 23:38:00,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:00,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:38:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335411772] [2020-10-05 23:38:00,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:38:00,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:38:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:00,881 INFO L87 Difference]: Start difference. First operand 153 states and 355 transitions. Second operand 5 states. [2020-10-05 23:38:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:00,927 INFO L93 Difference]: Finished difference Result 124 states and 251 transitions. [2020-10-05 23:38:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:38:00,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:38:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:00,929 INFO L225 Difference]: With dead ends: 124 [2020-10-05 23:38:00,929 INFO L226 Difference]: Without dead ends: 93 [2020-10-05 23:38:00,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:38:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-05 23:38:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-05 23:38:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-05 23:38:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 179 transitions. [2020-10-05 23:38:00,933 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 179 transitions. Word has length 16 [2020-10-05 23:38:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:00,933 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 179 transitions. [2020-10-05 23:38:00,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:38:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 179 transitions. [2020-10-05 23:38:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:38:00,934 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:00,934 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-05 23:38:00,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:38:00,934 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times [2020-10-05 23:38:00,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:00,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126513159] [2020-10-05 23:38:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:01,029 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-05 23:38:01,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126513159] [2020-10-05 23:38:01,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:01,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:38:01,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614127892] [2020-10-05 23:38:01,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:38:01,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:01,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:38:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:38:01,032 INFO L87 Difference]: Start difference. First operand 93 states and 179 transitions. Second operand 6 states. [2020-10-05 23:38:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:01,085 INFO L93 Difference]: Finished difference Result 79 states and 149 transitions. [2020-10-05 23:38:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:38:01,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:38:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:01,087 INFO L225 Difference]: With dead ends: 79 [2020-10-05 23:38:01,087 INFO L226 Difference]: Without dead ends: 70 [2020-10-05 23:38:01,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:38:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-05 23:38:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-05 23:38:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-05 23:38:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2020-10-05 23:38:01,090 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 18 [2020-10-05 23:38:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:01,091 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2020-10-05 23:38:01,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:38:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2020-10-05 23:38:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:38:01,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:01,092 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-05 23:38:01,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:38:01,092 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times [2020-10-05 23:38:01,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:01,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836641018] [2020-10-05 23:38:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:01,349 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-05 23:38:01,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836641018] [2020-10-05 23:38:01,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:01,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:38:01,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800742436] [2020-10-05 23:38:01,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:38:01,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:38:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:38:01,352 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 8 states. [2020-10-05 23:38:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:01,459 INFO L93 Difference]: Finished difference Result 90 states and 168 transitions. [2020-10-05 23:38:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:01,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 23:38:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:01,461 INFO L225 Difference]: With dead ends: 90 [2020-10-05 23:38:01,461 INFO L226 Difference]: Without dead ends: 50 [2020-10-05 23:38:01,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:38:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-05 23:38:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-05 23:38:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-05 23:38:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-05 23:38:01,466 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-10-05 23:38:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:01,467 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-05 23:38:01,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:38:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-05 23:38:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:38:01,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:01,467 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-05 23:38:01,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:38:01,468 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times [2020-10-05 23:38:01,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:01,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457668425] [2020-10-05 23:38:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:38:01,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:38:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:38:01,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:38:01,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:38:01,642 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:38:01,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:38:01,643 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:38:01,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse9 (= (mod ~x$r_buff1_thd0~0_In-335544113 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-335544113 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In-335544113 256))) (.cse7 (= (mod ~x$w_buff0_used~0_In-335544113 256) 0))) (let ((.cse3 (or .cse6 .cse7)) (.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff1_used~0_In-335544113 ~x$w_buff1_used~0_Out-335544113)) (and .cse1 (= ~x$w_buff1_used~0_Out-335544113 0) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-335544113 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-335544113|) (or (and .cse3 (= ~x$w_buff0_used~0_Out-335544113 ~x$w_buff0_used~0_In-335544113)) (and .cse4 (= ~x$w_buff0_used~0_Out-335544113 0) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-335544113 0)) (= ~x$r_buff0_thd0~0_In-335544113 ~x$r_buff0_thd0~0_Out-335544113) (= ~x$r_buff1_thd0~0_Out-335544113 ~x$r_buff1_thd0~0_In-335544113) (or (and .cse3 (or (and .cse1 .cse2 (= ~x$w_buff1~0_In-335544113 ~x~0_Out-335544113)) (and (= ~x~0_In-335544113 ~x~0_Out-335544113) .cse0))) (and (= ~x$w_buff0~0_In-335544113 ~x~0_Out-335544113) .cse4 .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-335544113, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-335544113, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-335544113|, ~x$w_buff1~0=~x$w_buff1~0_In-335544113, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-335544113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-335544113, ~x~0=~x~0_In-335544113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-335544113} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-335544113, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-335544113, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-335544113|, ~x$w_buff1~0=~x$w_buff1~0_In-335544113, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-335544113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-335544113, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-335544113|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-335544113|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-335544113|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-335544113, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-335544113, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-335544113|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-335544113|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-335544113, ~x~0=~x~0_Out-335544113} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:38:01,663 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-05 23:38:01,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,667 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-05 23:38:01,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,668 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-05 23:38:01,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,669 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-05 23:38:01,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,670 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-05 23:38:01,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,670 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-05 23:38:01,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,670 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-05 23:38:01,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,671 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-05 23:38:01,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,672 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-05 23:38:01,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,672 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-05 23:38:01,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,672 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-05 23:38:01,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,673 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-05 23:38:01,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,673 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-05 23:38:01,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,674 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-05 23:38:01,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,674 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-05 23:38:01,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,674 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-05 23:38:01,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,675 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-05 23:38:01,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,676 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-05 23:38:01,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,676 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-05 23:38:01,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,680 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-05 23:38:01,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,680 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-05 23:38:01,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,681 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-05 23:38:01,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,681 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-05 23:38:01,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,682 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-05 23:38:01,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,682 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-05 23:38:01,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,682 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-05 23:38:01,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,682 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-05 23:38:01,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,683 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-05 23:38:01,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,683 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-05 23:38:01,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,684 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-05 23:38:01,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,684 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-05 23:38:01,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,684 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-05 23:38:01,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:01,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:38:01 BasicIcfg [2020-10-05 23:38:01,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:38:01,772 INFO L168 Benchmark]: Toolchain (without parser) took 15632.90 ms. Allocated memory was 140.0 MB in the beginning and 354.9 MB in the end (delta: 215.0 MB). Free memory was 101.5 MB in the beginning and 79.7 MB in the end (delta: 21.9 MB). Peak memory consumption was 236.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,773 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.32 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.1 MB in the beginning and 156.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,775 INFO L168 Benchmark]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,776 INFO L168 Benchmark]: RCFGBuilder took 2093.33 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 150.8 MB in the beginning and 165.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,780 INFO L168 Benchmark]: TraceAbstraction took 12698.68 ms. Allocated memory was 247.5 MB in the beginning and 354.9 MB in the end (delta: 107.5 MB). Free memory was 165.7 MB in the beginning and 79.7 MB in the end (delta: 86.0 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:01,787 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.32 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.1 MB in the beginning and 156.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2093.33 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 150.8 MB in the beginning and 165.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12698.68 ms. Allocated memory was 247.5 MB in the beginning and 354.9 MB in the end (delta: 107.5 MB). Free memory was 165.7 MB in the beginning and 79.7 MB in the end (delta: 86.0 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.7s, 100 ProgramPointsBefore, 36 ProgramPointsAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 810 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4410 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1816; [L808] FCALL, FORK 0 pthread_create(&t1816, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L809] 0 pthread_t t1817; [L810] FCALL, FORK 0 pthread_create(&t1817, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L811] 0 pthread_t t1818; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L812] FCALL, FORK 0 pthread_create(&t1818, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2] [L730] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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] [L765] 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) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] 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) [L765] 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) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 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 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 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 [L785] 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) [L785] 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) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 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 [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 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 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] 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) [L736] 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) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 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 [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 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 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] 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) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] 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) [L829] 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) [L830] 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)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] 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) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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) [L835] 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)) [L835] 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)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 297 SDtfs, 348 SDslu, 442 SDs, 0 SdLazy, 361 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s 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, 14 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 17299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...