/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:01:50,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:01:50,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:01:50,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:01:50,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:01:50,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:01:50,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:01:50,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:01:50,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:01:50,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:01:50,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:01:50,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:01:50,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:01:50,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:01:50,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:01:50,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:01:50,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:01:50,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:01:50,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:01:50,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:01:50,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:01:50,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:01:50,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:01:50,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:01:50,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:01:50,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:01:50,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:01:50,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:01:50,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:01:50,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:01:50,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:01:50,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:01:50,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:01:50,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:01:50,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:01:50,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:01:50,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:01:50,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:01:50,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:01:50,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:01:50,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:01:50,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:01:50,725 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:01:50,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:01:50,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:01:50,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:01:50,729 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:01:50,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:01:50,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:01:50,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:01:50,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:01:50,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:01:50,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:01:50,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:01:50,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:01:50,732 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:01:50,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:01:50,732 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:01:50,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:01:50,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:01:50,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:01:50,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:01:50,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:01:50,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:01:50,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:01:50,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:01:50,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:01:50,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:01:50,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:01:50,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:01:50,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:01:51,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:01:51,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:01:51,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:01:51,048 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:01:51,049 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:01:51,049 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-10-15 22:01:51,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fd645e8/3f66bb0270ee497d88bdbc90297fdac3/FLAG1c41c46be [2020-10-15 22:01:51,678 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:01:51,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-10-15 22:01:51,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fd645e8/3f66bb0270ee497d88bdbc90297fdac3/FLAG1c41c46be [2020-10-15 22:01:51,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fd645e8/3f66bb0270ee497d88bdbc90297fdac3 [2020-10-15 22:01:51,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:01:51,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:01:51,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:01:51,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:01:51,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:01:51,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:01:51" (1/1) ... [2020-10-15 22:01:51,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d9f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:51, skipping insertion in model container [2020-10-15 22:01:51,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:01:51" (1/1) ... [2020-10-15 22:01:51,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:01:51,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:01:52,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:01:52,522 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:01:52,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:01:52,663 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:01:52,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52 WrapperNode [2020-10-15 22:01:52,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:01:52,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:01:52,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:01:52,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:01:52,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:01:52,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:01:52,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:01:52,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:01:52,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... [2020-10-15 22:01:52,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:01:52,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:01:52,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:01:52,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:01:52,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:01:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:01:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:01:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:01:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:01:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:01:52,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:01:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:01:52,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:01:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:01:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:01:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:01:52,868 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:01:54,894 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:01:54,895 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:01:54,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:01:54 BoogieIcfgContainer [2020-10-15 22:01:54,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:01:54,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:01:54,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:01:54,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:01:54,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:01:51" (1/3) ... [2020-10-15 22:01:54,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25173cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:01:54, skipping insertion in model container [2020-10-15 22:01:54,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:01:52" (2/3) ... [2020-10-15 22:01:54,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25173cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:01:54, skipping insertion in model container [2020-10-15 22:01:54,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:01:54" (3/3) ... [2020-10-15 22:01:54,906 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2020-10-15 22:01:54,918 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:01:54,918 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:01:54,925 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:01:54,927 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:01:54,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:01:54,991 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-15 22:01:55,010 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:01:55,011 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:01:55,011 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:01:55,011 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:01:55,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:01:55,011 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:01:55,011 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:01:55,011 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:01:55,023 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:01:55,026 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-15 22:01:55,029 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-15 22:01:55,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-15 22:01:55,071 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-15 22:01:55,071 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:01:55,076 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-15 22:01:55,078 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-15 22:01:55,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,439 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-15 22:01:55,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:55,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:55,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:55,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:55,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:01:55,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:55,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:55,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:55,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:01:55,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:55,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:01:55,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:55,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 22:01:55,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:55,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-15 22:01:55,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:55,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 22:01:55,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:57,181 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-15 22:01:57,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-15 22:01:57,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:57,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 22:01:57,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:57,908 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-15 22:01:57,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:57,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:57,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:57,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:57,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:57,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:57,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:57,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:57,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:57,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:57,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:57,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:57,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:57,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:57,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:01:57,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:01:58,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:58,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:01:58,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:58,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:58,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:01:58,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:58,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:01:58,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:58,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:58,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:01:58,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:01:58,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:01:59,009 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-15 22:01:59,121 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-15 22:01:59,939 WARN L193 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2020-10-15 22:02:00,274 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 22:02:00,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:00,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:00,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:00,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:00,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:00,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:00,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:00,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:00,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:01,208 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-15 22:02:01,309 INFO L132 LiptonReduction]: Checked pairs total: 2289 [2020-10-15 22:02:01,309 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-15 22:02:01,316 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2020-10-15 22:02:01,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-10-15 22:02:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-10-15 22:02:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:02:01,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:01,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:02:01,346 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 862545524, now seen corresponding path program 1 times [2020-10-15 22:02:01,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:01,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114097358] [2020-10-15 22:02:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:01,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114097358] [2020-10-15 22:02:01,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:01,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:02:01,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181417813] [2020-10-15 22:02:01,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:02:01,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:01,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:02:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:02:01,611 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2020-10-15 22:02:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:01,677 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-10-15 22:02:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:02:01,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:02:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:01,693 INFO L225 Difference]: With dead ends: 162 [2020-10-15 22:02:01,693 INFO L226 Difference]: Without dead ends: 137 [2020-10-15 22:02:01,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:02:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-15 22:02:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-15 22:02:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-15 22:02:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-15 22:02:01,754 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2020-10-15 22:02:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:01,754 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-15 22:02:01,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:02:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-15 22:02:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-15 22:02:01,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:01,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:01,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:02:01,756 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash -694030530, now seen corresponding path program 1 times [2020-10-15 22:02:01,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:01,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446550339] [2020-10-15 22:02:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:02,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-15 22:02:02,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446550339] [2020-10-15 22:02:02,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:02,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:02:02,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397988270] [2020-10-15 22:02:02,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:02,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:02,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:02,068 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 5 states. [2020-10-15 22:02:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:02,216 INFO L93 Difference]: Finished difference Result 159 states and 353 transitions. [2020-10-15 22:02:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:02:02,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-15 22:02:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:02,220 INFO L225 Difference]: With dead ends: 159 [2020-10-15 22:02:02,220 INFO L226 Difference]: Without dead ends: 134 [2020-10-15 22:02:02,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-15 22:02:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-15 22:02:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-15 22:02:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 310 transitions. [2020-10-15 22:02:02,236 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 310 transitions. Word has length 8 [2020-10-15 22:02:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:02,237 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 310 transitions. [2020-10-15 22:02:02,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 310 transitions. [2020-10-15 22:02:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 22:02:02,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:02,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:02,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:02:02,239 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash -40157678, now seen corresponding path program 1 times [2020-10-15 22:02:02,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:02,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332692233] [2020-10-15 22:02:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:02,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332692233] [2020-10-15 22:02:02,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:02,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:02,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025076613] [2020-10-15 22:02:02,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:02:02,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:02,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:02:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:02:02,511 INFO L87 Difference]: Start difference. First operand 134 states and 310 transitions. Second operand 6 states. [2020-10-15 22:02:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:02,704 INFO L93 Difference]: Finished difference Result 146 states and 321 transitions. [2020-10-15 22:02:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:02,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-15 22:02:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:02,707 INFO L225 Difference]: With dead ends: 146 [2020-10-15 22:02:02,707 INFO L226 Difference]: Without dead ends: 126 [2020-10-15 22:02:02,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-15 22:02:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-10-15 22:02:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-15 22:02:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 286 transitions. [2020-10-15 22:02:02,721 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 286 transitions. Word has length 9 [2020-10-15 22:02:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:02,721 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 286 transitions. [2020-10-15 22:02:02,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:02:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 286 transitions. [2020-10-15 22:02:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 22:02:02,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:02,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:02,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:02:02,723 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash 742708133, now seen corresponding path program 1 times [2020-10-15 22:02:02,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:02,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16578048] [2020-10-15 22:02:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:02,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16578048] [2020-10-15 22:02:02,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:02,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:02,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385235882] [2020-10-15 22:02:02,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:02:02,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:02:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:02:02,948 INFO L87 Difference]: Start difference. First operand 126 states and 286 transitions. Second operand 6 states. [2020-10-15 22:02:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:03,090 INFO L93 Difference]: Finished difference Result 139 states and 303 transitions. [2020-10-15 22:02:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:02:03,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-15 22:02:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:03,092 INFO L225 Difference]: With dead ends: 139 [2020-10-15 22:02:03,092 INFO L226 Difference]: Without dead ends: 124 [2020-10-15 22:02:03,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-15 22:02:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2020-10-15 22:02:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-15 22:02:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 278 transitions. [2020-10-15 22:02:03,103 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 278 transitions. Word has length 10 [2020-10-15 22:02:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:03,104 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 278 transitions. [2020-10-15 22:02:03,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:02:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 278 transitions. [2020-10-15 22:02:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:02:03,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:03,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:03,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:02:03,106 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1549051578, now seen corresponding path program 1 times [2020-10-15 22:02:03,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:03,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840627730] [2020-10-15 22:02:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:03,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840627730] [2020-10-15 22:02:03,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:03,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:03,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844474222] [2020-10-15 22:02:03,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:03,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:03,513 INFO L87 Difference]: Start difference. First operand 123 states and 278 transitions. Second operand 7 states. [2020-10-15 22:02:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:03,638 INFO L93 Difference]: Finished difference Result 129 states and 283 transitions. [2020-10-15 22:02:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:03,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-15 22:02:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:03,640 INFO L225 Difference]: With dead ends: 129 [2020-10-15 22:02:03,640 INFO L226 Difference]: Without dead ends: 119 [2020-10-15 22:02:03,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-15 22:02:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-15 22:02:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-15 22:02:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 268 transitions. [2020-10-15 22:02:03,648 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 268 transitions. Word has length 11 [2020-10-15 22:02:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:03,649 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 268 transitions. [2020-10-15 22:02:03,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 268 transitions. [2020-10-15 22:02:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:02:03,650 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:03,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:03,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:02:03,650 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1549067915, now seen corresponding path program 1 times [2020-10-15 22:02:03,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:03,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953001658] [2020-10-15 22:02:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:03,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953001658] [2020-10-15 22:02:03,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:03,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:03,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242244052] [2020-10-15 22:02:03,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:03,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:03,845 INFO L87 Difference]: Start difference. First operand 119 states and 268 transitions. Second operand 7 states. [2020-10-15 22:02:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:04,060 INFO L93 Difference]: Finished difference Result 147 states and 323 transitions. [2020-10-15 22:02:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:02:04,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-15 22:02:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:04,063 INFO L225 Difference]: With dead ends: 147 [2020-10-15 22:02:04,063 INFO L226 Difference]: Without dead ends: 131 [2020-10-15 22:02:04,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:02:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-15 22:02:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2020-10-15 22:02:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-15 22:02:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 269 transitions. [2020-10-15 22:02:04,070 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 269 transitions. Word has length 11 [2020-10-15 22:02:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:04,070 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 269 transitions. [2020-10-15 22:02:04,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 269 transitions. [2020-10-15 22:02:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:02:04,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:04,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:04,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:02:04,072 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash 61343251, now seen corresponding path program 1 times [2020-10-15 22:02:04,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:04,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670733336] [2020-10-15 22:02:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:04,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670733336] [2020-10-15 22:02:04,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:04,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:02:04,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581466711] [2020-10-15 22:02:04,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:02:04,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:02:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:02:04,134 INFO L87 Difference]: Start difference. First operand 121 states and 269 transitions. Second operand 4 states. [2020-10-15 22:02:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:04,171 INFO L93 Difference]: Finished difference Result 140 states and 292 transitions. [2020-10-15 22:02:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:02:04,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 22:02:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:04,173 INFO L225 Difference]: With dead ends: 140 [2020-10-15 22:02:04,174 INFO L226 Difference]: Without dead ends: 113 [2020-10-15 22:02:04,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-15 22:02:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-15 22:02:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-15 22:02:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 245 transitions. [2020-10-15 22:02:04,179 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 245 transitions. Word has length 11 [2020-10-15 22:02:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:04,180 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 245 transitions. [2020-10-15 22:02:04,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:02:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 245 transitions. [2020-10-15 22:02:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:02:04,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:04,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:04,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:02:04,182 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1345758819, now seen corresponding path program 2 times [2020-10-15 22:02:04,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:04,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998246220] [2020-10-15 22:02:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:04,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998246220] [2020-10-15 22:02:04,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:04,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:04,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102020896] [2020-10-15 22:02:04,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:04,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:04,251 INFO L87 Difference]: Start difference. First operand 113 states and 245 transitions. Second operand 5 states. [2020-10-15 22:02:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:04,299 INFO L93 Difference]: Finished difference Result 102 states and 185 transitions. [2020-10-15 22:02:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:04,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-15 22:02:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:04,301 INFO L225 Difference]: With dead ends: 102 [2020-10-15 22:02:04,301 INFO L226 Difference]: Without dead ends: 76 [2020-10-15 22:02:04,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-15 22:02:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-15 22:02:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-15 22:02:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2020-10-15 22:02:04,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 11 [2020-10-15 22:02:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:04,305 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2020-10-15 22:02:04,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2020-10-15 22:02:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:02:04,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:04,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:04,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:02:04,307 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1248066376, now seen corresponding path program 1 times [2020-10-15 22:02:04,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:04,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629058754] [2020-10-15 22:02:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:04,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629058754] [2020-10-15 22:02:04,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:04,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:04,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40517058] [2020-10-15 22:02:04,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:04,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:04,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:04,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:04,380 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 5 states. [2020-10-15 22:02:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:04,412 INFO L93 Difference]: Finished difference Result 55 states and 86 transitions. [2020-10-15 22:02:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:04,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 22:02:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:04,413 INFO L225 Difference]: With dead ends: 55 [2020-10-15 22:02:04,413 INFO L226 Difference]: Without dead ends: 46 [2020-10-15 22:02:04,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-15 22:02:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2020-10-15 22:02:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-15 22:02:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-15 22:02:04,416 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2020-10-15 22:02:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:04,416 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-15 22:02:04,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-15 22:02:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:04,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:04,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:04,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:02:04,417 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash 859005772, now seen corresponding path program 1 times [2020-10-15 22:02:04,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:04,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542052032] [2020-10-15 22:02:04,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:04,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542052032] [2020-10-15 22:02:04,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:04,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 22:02:04,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728781624] [2020-10-15 22:02:04,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 22:02:04,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 22:02:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:02:04,685 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 9 states. [2020-10-15 22:02:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:04,876 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-10-15 22:02:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:02:04,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-15 22:02:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:04,877 INFO L225 Difference]: With dead ends: 60 [2020-10-15 22:02:04,878 INFO L226 Difference]: Without dead ends: 39 [2020-10-15 22:02:04,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:02:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-15 22:02:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-15 22:02:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-15 22:02:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2020-10-15 22:02:04,880 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 16 [2020-10-15 22:02:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:04,880 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2020-10-15 22:02:04,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 22:02:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2020-10-15 22:02:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:04,881 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:04,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:04,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:02:04,882 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash -849292188, now seen corresponding path program 2 times [2020-10-15 22:02:04,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:04,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131190582] [2020-10-15 22:02:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:04,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131190582] [2020-10-15 22:02:04,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:04,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:04,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124035889] [2020-10-15 22:02:04,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:04,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:04,979 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 7 states. [2020-10-15 22:02:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:05,060 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2020-10-15 22:02:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:02:05,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 22:02:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:05,062 INFO L225 Difference]: With dead ends: 50 [2020-10-15 22:02:05,062 INFO L226 Difference]: Without dead ends: 29 [2020-10-15 22:02:05,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:02:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-15 22:02:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-15 22:02:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-15 22:02:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-15 22:02:05,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-10-15 22:02:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:05,065 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-15 22:02:05,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-15 22:02:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:05,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:05,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:05,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:02:05,066 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1784061012, now seen corresponding path program 3 times [2020-10-15 22:02:05,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:05,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050698510] [2020-10-15 22:02:05,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:05,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050698510] [2020-10-15 22:02:05,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:05,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 22:02:05,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366476537] [2020-10-15 22:02:05,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 22:02:05,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 22:02:05,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:02:05,292 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 9 states. [2020-10-15 22:02:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:05,387 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-15 22:02:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:02:05,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-15 22:02:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:05,388 INFO L225 Difference]: With dead ends: 44 [2020-10-15 22:02:05,388 INFO L226 Difference]: Without dead ends: 29 [2020-10-15 22:02:05,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:02:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-15 22:02:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-15 22:02:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-15 22:02:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-10-15 22:02:05,392 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2020-10-15 22:02:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:05,394 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-10-15 22:02:05,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 22:02:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-10-15 22:02:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:05,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:05,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:05,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:02:05,397 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1116950450, now seen corresponding path program 4 times [2020-10-15 22:02:05,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:05,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75676250] [2020-10-15 22:02:05,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:05,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75676250] [2020-10-15 22:02:05,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:05,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 22:02:05,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427502850] [2020-10-15 22:02:05,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 22:02:05,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 22:02:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:02:05,615 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 10 states. [2020-10-15 22:02:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:05,779 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-10-15 22:02:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:02:05,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-15 22:02:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:05,781 INFO L225 Difference]: With dead ends: 35 [2020-10-15 22:02:05,781 INFO L226 Difference]: Without dead ends: 25 [2020-10-15 22:02:05,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-15 22:02:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-15 22:02:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-15 22:02:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-15 22:02:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-15 22:02:05,783 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-15 22:02:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:05,783 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-15 22:02:05,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 22:02:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-15 22:02:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:05,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:05,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:05,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:02:05,785 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash -141973066, now seen corresponding path program 5 times [2020-10-15 22:02:05,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:05,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365277890] [2020-10-15 22:02:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:06,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365277890] [2020-10-15 22:02:06,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:06,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 22:02:06,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698574628] [2020-10-15 22:02:06,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 22:02:06,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 22:02:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:02:06,114 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 9 states. [2020-10-15 22:02:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:06,301 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-15 22:02:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:06,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-15 22:02:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:06,302 INFO L225 Difference]: With dead ends: 34 [2020-10-15 22:02:06,302 INFO L226 Difference]: Without dead ends: 21 [2020-10-15 22:02:06,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-10-15 22:02:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-15 22:02:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-15 22:02:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-15 22:02:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-15 22:02:06,304 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-15 22:02:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:06,304 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-15 22:02:06,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 22:02:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-15 22:02:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:06,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:06,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:06,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:02:06,306 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1111540702, now seen corresponding path program 6 times [2020-10-15 22:02:06,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:06,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473764017] [2020-10-15 22:02:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:02:06,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:02:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:02:06,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:02:06,412 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:02:06,412 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:02:06,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:02:06,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,431 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,431 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,441 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:02:06,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:06,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:02:06 BasicIcfg [2020-10-15 22:02:06,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:02:06,488 INFO L168 Benchmark]: Toolchain (without parser) took 14596.16 ms. Allocated memory was 254.8 MB in the beginning and 519.6 MB in the end (delta: 264.8 MB). Free memory was 206.2 MB in the beginning and 311.6 MB in the end (delta: -105.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,489 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 254.8 MB. Free memory was 230.3 MB in the beginning and 229.5 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.06 ms. Allocated memory was 254.8 MB in the beginning and 327.2 MB in the end (delta: 72.4 MB). Free memory was 206.2 MB in the beginning and 279.9 MB in the end (delta: -73.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.43 ms. Allocated memory is still 327.2 MB. Free memory was 279.9 MB in the beginning and 276.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,491 INFO L168 Benchmark]: Boogie Preprocessor took 37.76 ms. Allocated memory is still 327.2 MB. Free memory was 276.5 MB in the beginning and 274.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,491 INFO L168 Benchmark]: RCFGBuilder took 2126.95 ms. Allocated memory was 327.2 MB in the beginning and 362.3 MB in the end (delta: 35.1 MB). Free memory was 274.0 MB in the beginning and 224.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 101.0 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,492 INFO L168 Benchmark]: TraceAbstraction took 11587.71 ms. Allocated memory was 362.3 MB in the beginning and 519.6 MB in the end (delta: 157.3 MB). Free memory was 224.8 MB in the beginning and 311.6 MB in the end (delta: -86.8 MB). Peak memory consumption was 70.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:06,496 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 254.8 MB. Free memory was 230.3 MB in the beginning and 229.5 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 770.06 ms. Allocated memory was 254.8 MB in the beginning and 327.2 MB in the end (delta: 72.4 MB). Free memory was 206.2 MB in the beginning and 279.9 MB in the end (delta: -73.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.43 ms. Allocated memory is still 327.2 MB. Free memory was 279.9 MB in the beginning and 276.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.76 ms. Allocated memory is still 327.2 MB. Free memory was 276.5 MB in the beginning and 274.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2126.95 ms. Allocated memory was 327.2 MB in the beginning and 362.3 MB in the end (delta: 35.1 MB). Free memory was 274.0 MB in the beginning and 224.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 101.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11587.71 ms. Allocated memory was 362.3 MB in the beginning and 519.6 MB in the end (delta: 157.3 MB). Free memory was 224.8 MB in the beginning and 311.6 MB in the end (delta: -86.8 MB). Peak memory consumption was 70.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 528 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 56 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 80 PlacesBefore, 27 PlacesAfterwards, 75 TransitionsBefore, 21 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2289 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1447; [L782] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 0 pthread_t t1448; [L784] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 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) [L759] 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) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 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 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 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 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L731] 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) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] 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) [L731] 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) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 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 [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 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 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L790] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] 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) [L801] 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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 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)) [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L806] 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)) [L806] 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)) [L807] 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)) [L807] 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) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] 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) [L807] 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)) [L807] 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)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 231 SDtfs, 297 SDslu, 604 SDs, 0 SdLazy, 516 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 23172 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...