/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:41:50,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:41:50,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:41:50,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:41:50,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:41:50,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:41:50,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:41:50,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:41:50,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:41:50,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:41:50,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:41:50,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:41:50,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:41:50,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:41:50,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:41:50,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:41:50,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:41:50,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:41:50,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:41:50,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:41:50,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:41:50,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:41:50,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:41:50,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:41:50,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:41:50,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:41:50,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:41:50,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:41:50,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:41:50,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:41:50,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:41:50,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:41:50,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:41:50,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:41:50,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:41:50,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:41:50,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:41:50,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:41:50,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:41:50,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:41:50,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:41:50,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:41:50,724 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:41:50,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:41:50,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:41:50,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:41:50,726 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:41:50,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:41:50,726 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:41:50,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:41:50,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:41:50,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:41:50,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:41:50,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:41:50,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:41:50,729 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:41:50,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:41:50,729 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:41:50,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:41:50,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:41:50,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:41:50,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:41:50,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:41:50,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:41:50,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:41:50,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:41:50,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:41:50,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:41:50,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:41:50,731 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:41:50,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:41:51,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:41:51,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:41:51,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:41:51,073 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:41:51,073 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:41:51,074 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-05 23:41:51,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618d31d08/b7b2886956934513be21f4c8448cc673/FLAGa9a479290 [2020-10-05 23:41:51,697 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:41:51,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-05 23:41:51,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618d31d08/b7b2886956934513be21f4c8448cc673/FLAGa9a479290 [2020-10-05 23:41:51,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618d31d08/b7b2886956934513be21f4c8448cc673 [2020-10-05 23:41:51,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:41:51,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:41:51,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:41:51,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:41:51,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:41:51,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:41:51" (1/1) ... [2020-10-05 23:41:51,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3f0c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:51, skipping insertion in model container [2020-10-05 23:41:51,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:41:51" (1/1) ... [2020-10-05 23:41:51,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:41:52,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:41:52,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:41:52,572 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:41:52,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:41:52,725 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:41:52,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52 WrapperNode [2020-10-05 23:41:52,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:41:52,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:41:52,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:41:52,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:41:52,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:41:52,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:41:52,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:41:52,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:41:52,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (1/1) ... [2020-10-05 23:41:52,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:41:52,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:41:52,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:41:52,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:41:52,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41: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-05 23:41:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:41:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:41:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:41:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:41:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:41:52,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:41:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:41:52,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:41:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:41:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:41:52,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:41:52,924 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:41:55,069 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:41:55,069 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:41:55,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:41:55 BoogieIcfgContainer [2020-10-05 23:41:55,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:41:55,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:41:55,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:41:55,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:41:55,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:41:51" (1/3) ... [2020-10-05 23:41:55,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27090d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:41:55, skipping insertion in model container [2020-10-05 23:41:55,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:52" (2/3) ... [2020-10-05 23:41:55,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27090d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:41:55, skipping insertion in model container [2020-10-05 23:41:55,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:41:55" (3/3) ... [2020-10-05 23:41:55,080 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2020-10-05 23:41:55,092 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:41:55,092 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:41:55,100 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:41:55,101 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:41:55,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,129 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,152 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,153 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,153 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:55,178 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:41:55,200 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:41:55,201 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:41:55,201 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:41:55,201 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:41:55,201 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:41:55,201 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:41:55,201 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:41:55,202 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:41:55,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-05 23:41:55,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-05 23:41:55,260 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-05 23:41:55,260 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:41:55,265 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 23:41:55,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-05 23:41:55,286 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-05 23:41:55,287 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:41:55,287 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 23:41:55,289 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 888 [2020-10-05 23:41:55,290 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:41:55,785 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:41:55,910 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:41:56,133 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-05 23:41:57,362 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-05 23:41:57,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 23:41:57,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:41:57,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 23:41:57,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:41:58,271 WARN L193 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-05 23:41:59,224 WARN L193 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2020-10-05 23:41:59,520 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-05 23:42:00,084 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-05 23:42:00,345 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-05 23:42:00,882 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:42:01,168 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:42:01,581 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:42:01,686 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2209 [2020-10-05 23:42:01,687 INFO L214 etLargeBlockEncoding]: Total number of compositions: 63 [2020-10-05 23:42:01,691 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-05 23:42:01,707 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-05 23:42:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-05 23:42:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:42:01,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:01,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:42:01,717 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 859717262, now seen corresponding path program 1 times [2020-10-05 23:42:01,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:01,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120863411] [2020-10-05 23:42:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:01,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120863411] [2020-10-05 23:42:01,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:01,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:01,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791833690] [2020-10-05 23:42:01,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:01,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:01,965 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-05 23:42:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:02,044 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-05 23:42:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:02,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:42:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:02,059 INFO L225 Difference]: With dead ends: 137 [2020-10-05 23:42:02,059 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:42:02,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:42:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-05 23:42:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-05 23:42:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-05 23:42:02,111 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-05 23:42:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:02,111 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-05 23:42:02,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-05 23:42:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:42:02,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:02,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:02,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:42:02,113 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1554625103, now seen corresponding path program 1 times [2020-10-05 23:42:02,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:02,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705172184] [2020-10-05 23:42:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:02,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705172184] [2020-10-05 23:42:02,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:02,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:02,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240876065] [2020-10-05 23:42:02,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:02,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:02,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:02,248 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-05 23:42:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:02,305 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-05 23:42:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:02,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:42:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:02,312 INFO L225 Difference]: With dead ends: 111 [2020-10-05 23:42:02,313 INFO L226 Difference]: Without dead ends: 111 [2020-10-05 23:42:02,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-05 23:42:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-05 23:42:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-05 23:42:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-05 23:42:02,334 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-05 23:42:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:02,335 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-05 23:42:02,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-05 23:42:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:42:02,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:02,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:02,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:42:02,337 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash 948719512, now seen corresponding path program 1 times [2020-10-05 23:42:02,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:02,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091730114] [2020-10-05 23:42:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:02,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091730114] [2020-10-05 23:42:02,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:02,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:02,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977784130] [2020-10-05 23:42:02,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:02,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:02,572 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 5 states. [2020-10-05 23:42:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:02,667 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-05 23:42:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:02,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-05 23:42:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:02,669 INFO L225 Difference]: With dead ends: 110 [2020-10-05 23:42:02,670 INFO L226 Difference]: Without dead ends: 110 [2020-10-05 23:42:02,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-05 23:42:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-05 23:42:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-05 23:42:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-05 23:42:02,693 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 8 [2020-10-05 23:42:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:02,693 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-05 23:42:02,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-05 23:42:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:42:02,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:02,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:02,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:42:02,695 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash 948737399, now seen corresponding path program 1 times [2020-10-05 23:42:02,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:02,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635544160] [2020-10-05 23:42:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:02,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635544160] [2020-10-05 23:42:02,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:02,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:42:02,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123369661] [2020-10-05 23:42:02,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:02,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:02,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:02,889 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-05 23:42:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:02,944 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-05 23:42:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:02,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-05 23:42:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:02,947 INFO L225 Difference]: With dead ends: 109 [2020-10-05 23:42:02,947 INFO L226 Difference]: Without dead ends: 109 [2020-10-05 23:42:02,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-05 23:42:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-05 23:42:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-05 23:42:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-05 23:42:02,967 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-05 23:42:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:02,968 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-05 23:42:02,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-05 23:42:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:02,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:02,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:02,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:42:02,970 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash -654518260, now seen corresponding path program 1 times [2020-10-05 23:42:02,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:02,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516473320] [2020-10-05 23:42:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:03,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516473320] [2020-10-05 23:42:03,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:03,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:03,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306683023] [2020-10-05 23:42:03,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:03,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:03,075 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-05 23:42:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:03,148 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-05 23:42:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:03,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:42:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:03,150 INFO L225 Difference]: With dead ends: 154 [2020-10-05 23:42:03,150 INFO L226 Difference]: Without dead ends: 118 [2020-10-05 23:42:03,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-05 23:42:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-05 23:42:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-05 23:42:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-05 23:42:03,161 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-05 23:42:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:03,161 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-05 23:42:03,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-05 23:42:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:03,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:03,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:03,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:42:03,163 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:03,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:03,164 INFO L82 PathProgramCache]: Analyzing trace with hash -654466738, now seen corresponding path program 1 times [2020-10-05 23:42:03,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:03,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930047982] [2020-10-05 23:42:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:03,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930047982] [2020-10-05 23:42:03,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:03,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:03,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893710915] [2020-10-05 23:42:03,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:03,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:03,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:03,326 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-05 23:42:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:03,401 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-05 23:42:03,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:03,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:42:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:03,404 INFO L225 Difference]: With dead ends: 104 [2020-10-05 23:42:03,404 INFO L226 Difference]: Without dead ends: 104 [2020-10-05 23:42:03,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-05 23:42:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-05 23:42:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-05 23:42:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-05 23:42:03,410 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-05 23:42:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:03,410 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-05 23:42:03,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-05 23:42:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:03,411 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:03,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:03,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:42:03,412 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:03,412 INFO L82 PathProgramCache]: Analyzing trace with hash -653912861, now seen corresponding path program 1 times [2020-10-05 23:42:03,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:03,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674441063] [2020-10-05 23:42:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:03,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674441063] [2020-10-05 23:42:03,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:03,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:42:03,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332919544] [2020-10-05 23:42:03,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:03,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:03,466 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 4 states. [2020-10-05 23:42:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:03,503 INFO L93 Difference]: Finished difference Result 105 states and 222 transitions. [2020-10-05 23:42:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:03,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-05 23:42:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:03,506 INFO L225 Difference]: With dead ends: 105 [2020-10-05 23:42:03,506 INFO L226 Difference]: Without dead ends: 105 [2020-10-05 23:42:03,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-05 23:42:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-05 23:42:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-05 23:42:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 222 transitions. [2020-10-05 23:42:03,513 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 222 transitions. Word has length 9 [2020-10-05 23:42:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:03,513 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 222 transitions. [2020-10-05 23:42:03,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 222 transitions. [2020-10-05 23:42:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:03,514 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:03,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:03,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:42:03,515 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash -655211141, now seen corresponding path program 2 times [2020-10-05 23:42:03,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:03,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90579623] [2020-10-05 23:42:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:03,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90579623] [2020-10-05 23:42:03,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:03,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:03,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789352778] [2020-10-05 23:42:03,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:03,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:03,605 INFO L87 Difference]: Start difference. First operand 105 states and 222 transitions. Second operand 5 states. [2020-10-05 23:42:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:03,658 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-05 23:42:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:03,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:42:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:03,660 INFO L225 Difference]: With dead ends: 102 [2020-10-05 23:42:03,661 INFO L226 Difference]: Without dead ends: 102 [2020-10-05 23:42:03,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-05 23:42:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-05 23:42:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-05 23:42:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-05 23:42:03,666 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-05 23:42:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:03,666 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-05 23:42:03,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-05 23:42:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:42:03,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:03,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:03,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:42:03,668 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1186366444, now seen corresponding path program 1 times [2020-10-05 23:42:03,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:03,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960345048] [2020-10-05 23:42:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:03,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960345048] [2020-10-05 23:42:03,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:03,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:03,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054430718] [2020-10-05 23:42:03,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:03,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:03,798 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 6 states. [2020-10-05 23:42:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:03,934 INFO L93 Difference]: Finished difference Result 112 states and 233 transitions. [2020-10-05 23:42:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:03,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-05 23:42:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:03,937 INFO L225 Difference]: With dead ends: 112 [2020-10-05 23:42:03,937 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:42:03,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:42:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-10-05 23:42:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-05 23:42:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 220 transitions. [2020-10-05 23:42:03,941 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 220 transitions. Word has length 10 [2020-10-05 23:42:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:03,942 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 220 transitions. [2020-10-05 23:42:03,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 220 transitions. [2020-10-05 23:42:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:42:03,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:03,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:03,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:42:03,944 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1185068164, now seen corresponding path program 2 times [2020-10-05 23:42:03,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:03,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948080643] [2020-10-05 23:42:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:04,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948080643] [2020-10-05 23:42:04,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:04,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:04,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921636306] [2020-10-05 23:42:04,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:04,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:04,115 INFO L87 Difference]: Start difference. First operand 106 states and 220 transitions. Second operand 6 states. [2020-10-05 23:42:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:04,259 INFO L93 Difference]: Finished difference Result 112 states and 230 transitions. [2020-10-05 23:42:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:04,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-05 23:42:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:04,261 INFO L225 Difference]: With dead ends: 112 [2020-10-05 23:42:04,262 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:42:04,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:42:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2020-10-05 23:42:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-05 23:42:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-05 23:42:04,267 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-05 23:42:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:04,268 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-05 23:42:04,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-05 23:42:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:42:04,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:04,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:04,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:42:04,270 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1928407251, now seen corresponding path program 1 times [2020-10-05 23:42:04,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:04,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189682504] [2020-10-05 23:42:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:04,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189682504] [2020-10-05 23:42:04,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:04,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:04,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251685102] [2020-10-05 23:42:04,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:04,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:04,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:04,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:04,331 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 4 states. [2020-10-05 23:42:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:04,358 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2020-10-05 23:42:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:04,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:42:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:04,360 INFO L225 Difference]: With dead ends: 93 [2020-10-05 23:42:04,360 INFO L226 Difference]: Without dead ends: 66 [2020-10-05 23:42:04,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-05 23:42:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-05 23:42:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-05 23:42:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-10-05 23:42:04,364 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 11 [2020-10-05 23:42:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:04,410 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-10-05 23:42:04,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-10-05 23:42:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:42:04,411 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:04,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:04,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:42:04,411 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1324963649, now seen corresponding path program 1 times [2020-10-05 23:42:04,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:04,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638729386] [2020-10-05 23:42:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:04,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638729386] [2020-10-05 23:42:04,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:04,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:04,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161269786] [2020-10-05 23:42:04,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:04,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:04,469 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 5 states. [2020-10-05 23:42:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:04,498 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2020-10-05 23:42:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:04,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:42:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:04,499 INFO L225 Difference]: With dead ends: 52 [2020-10-05 23:42:04,499 INFO L226 Difference]: Without dead ends: 26 [2020-10-05 23:42:04,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-05 23:42:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-10-05 23:42:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 23:42:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-05 23:42:04,501 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-10-05 23:42:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:04,502 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-05 23:42:04,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-05 23:42:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:04,502 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:04,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:04,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:42:04,503 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:04,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1438791809, now seen corresponding path program 1 times [2020-10-05 23:42:04,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:04,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265109227] [2020-10-05 23:42:04,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:04,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265109227] [2020-10-05 23:42:04,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:04,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:04,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859438948] [2020-10-05 23:42:04,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:04,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:04,997 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 8 states. [2020-10-05 23:42:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:05,193 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-10-05 23:42:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:05,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-05 23:42:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:05,194 INFO L225 Difference]: With dead ends: 32 [2020-10-05 23:42:05,194 INFO L226 Difference]: Without dead ends: 20 [2020-10-05 23:42:05,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-05 23:42:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-05 23:42:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-05 23:42:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-05 23:42:05,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-10-05 23:42:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:05,197 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-05 23:42:05,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-05 23:42:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:05,198 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:05,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:05,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:42:05,198 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1509183925, now seen corresponding path program 2 times [2020-10-05 23:42:05,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:05,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077568012] [2020-10-05 23:42:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:05,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:05,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:05,302 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:42:05,303 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:42:05,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:42:05,304 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:42:05,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse6 (= (mod ~x$r_buff1_thd0~0_In-450736039 256) 0)) (.cse7 (= (mod ~x$w_buff1_used~0_In-450736039 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-450736039 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-450736039 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~x~0_Out-450736039 ~x$w_buff0~0_In-450736039) .cse1) (and .cse2 (or (and .cse3 (= ~x~0_In-450736039 ~x~0_Out-450736039)) (and (= ~x~0_Out-450736039 ~x$w_buff1~0_In-450736039) .cse4 .cse5)))) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-450736039 0)) (and .cse2 (= ~x$w_buff0_used~0_In-450736039 ~x$w_buff0_used~0_Out-450736039))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-450736039 0)) (= ~x$r_buff0_thd0~0_In-450736039 ~x$r_buff0_thd0~0_Out-450736039) (or (and (= ~x$w_buff1_used~0_Out-450736039 0) .cse4 .cse5) (and .cse3 (= ~x$w_buff1_used~0_In-450736039 ~x$w_buff1_used~0_Out-450736039))) (= ~x$r_buff1_thd0~0_Out-450736039 ~x$r_buff1_thd0~0_In-450736039)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-450736039, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-450736039, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-450736039, ~x$w_buff1~0=~x$w_buff1~0_In-450736039, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-450736039, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-450736039, ~x~0=~x~0_In-450736039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-450736039} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-450736039, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-450736039, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-450736039|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-450736039|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-450736039|, ~x$w_buff1~0=~x$w_buff1~0_In-450736039, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-450736039, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-450736039|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-450736039, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-450736039|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-450736039|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-450736039, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-450736039, ~x~0=~x~0_Out-450736039} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 23:42:05,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,328 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,331 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,332 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,332 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,339 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,340 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,340 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,340 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,341 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,341 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:05,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:05,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:42:05 BasicIcfg [2020-10-05 23:42:05,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:42:05,442 INFO L168 Benchmark]: Toolchain (without parser) took 13471.22 ms. Allocated memory was 140.0 MB in the beginning and 360.7 MB in the end (delta: 220.7 MB). Free memory was 101.9 MB in the beginning and 196.6 MB in the end (delta: -94.7 MB). Peak memory consumption was 126.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,443 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.31 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 101.7 MB in the beginning and 157.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.00 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,445 INFO L168 Benchmark]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,449 INFO L168 Benchmark]: RCFGBuilder took 2221.91 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 151.2 MB in the beginning and 200.1 MB in the end (delta: -48.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,451 INFO L168 Benchmark]: TraceAbstraction took 10366.82 ms. Allocated memory was 249.0 MB in the beginning and 360.7 MB in the end (delta: 111.7 MB). Free memory was 200.1 MB in the beginning and 196.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 115.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:05,456 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.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.31 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 101.7 MB in the beginning and 157.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.00 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2221.91 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 151.2 MB in the beginning and 200.1 MB in the end (delta: -48.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10366.82 ms. Allocated memory was 249.0 MB in the beginning and 360.7 MB in the end (delta: 111.7 MB). Free memory was 200.1 MB in the beginning and 196.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 115.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 79 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 19 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 460 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2209 CheckedPairsTotal, 63 TotalNumberOfCompositions - 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; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2483; [L780] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L781] 0 pthread_t t2484; [L782] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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] [L754] 2 y = 1 VAL [__unbuffered_cnt=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] [L723] 1 y = 2 VAL [__unbuffered_cnt=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=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=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=2] [L757] 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) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] 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) [L757] 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) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 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 [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 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 [L729] 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) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] 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) [L729] 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) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 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 [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 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 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] 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) [L799] 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) [L800] 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)) [L800] 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)) [L801] 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)) [L801] 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) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] 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) [L801] 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)) [L801] 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)) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 182 SDtfs, 170 SDslu, 241 SDs, 0 SdLazy, 262 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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, 13 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 14195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...