/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:09:46,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:09:46,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:09:46,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:09:46,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:09:46,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:09:46,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:09:46,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:09:46,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:09:46,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:09:46,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:09:46,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:09:46,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:09:46,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:09:46,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:09:46,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:09:46,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:09:46,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:09:46,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:09:46,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:09:46,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:09:46,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:09:46,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:09:46,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:09:46,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:09:46,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:09:46,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:09:46,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:09:46,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:09:46,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:09:46,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:09:46,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:09:46,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:09:46,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:09:46,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:09:46,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:09:46,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:09:46,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:09:46,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:09:46,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:09:46,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:09:46,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:09:46,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:09:46,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:09:46,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:09:46,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:09:46,795 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:09:46,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:09:46,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:09:46,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:09:46,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:09:46,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:09:46,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:09:46,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:09:46,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:09:46,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:09:46,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:09:46,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:09:46,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:09:46,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:09:46,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:09:46,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:09:46,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:09:46,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:09:46,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:09:46,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:09:46,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:09:46,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:09:46,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:09:46,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:09:46,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:09:46,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:09:47,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:09:47,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:09:47,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:09:47,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:09:47,100 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:09:47,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2019-12-26 22:09:47,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa404e9cd/6d2605e24aeb40fb96b71870c564c68b/FLAG638778953 [2019-12-26 22:09:47,730 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:09:47,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2019-12-26 22:09:47,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa404e9cd/6d2605e24aeb40fb96b71870c564c68b/FLAG638778953 [2019-12-26 22:09:47,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa404e9cd/6d2605e24aeb40fb96b71870c564c68b [2019-12-26 22:09:48,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:09:48,010 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:09:48,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:09:48,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:09:48,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:09:48,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:09:47" (1/1) ... [2019-12-26 22:09:48,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48, skipping insertion in model container [2019-12-26 22:09:48,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:09:47" (1/1) ... [2019-12-26 22:09:48,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:09:48,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:09:48,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:09:48,560 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:09:48,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:09:48,716 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:09:48,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48 WrapperNode [2019-12-26 22:09:48,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:09:48,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:09:48,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:09:48,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:09:48,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:09:48,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:09:48,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:09:48,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:09:48,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (1/1) ... [2019-12-26 22:09:48,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:09:48,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:09:48,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:09:48,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:09:48,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (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 [2019-12-26 22:09:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:09:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:09:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:09:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:09:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:09:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:09:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:09:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:09:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:09:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:09:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:09:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:09:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:09:48,903 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:09:49,674 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:09:49,674 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:09:49,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:09:49 BoogieIcfgContainer [2019-12-26 22:09:49,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:09:49,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:09:49,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:09:49,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:09:49,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:09:47" (1/3) ... [2019-12-26 22:09:49,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edd3b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:09:49, skipping insertion in model container [2019-12-26 22:09:49,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:48" (2/3) ... [2019-12-26 22:09:49,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edd3b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:09:49, skipping insertion in model container [2019-12-26 22:09:49,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:09:49" (3/3) ... [2019-12-26 22:09:49,685 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_pso.oepc.i [2019-12-26 22:09:49,695 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:09:49,696 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:09:49,704 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:09:49,705 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:09:49,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,760 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,760 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,777 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,778 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:49,858 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:09:49,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:09:49,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:09:49,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:09:49,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:09:49,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:09:49,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:09:49,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:09:49,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:09:49,912 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 22:09:49,914 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:09:50,038 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:09:50,038 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:09:50,055 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:09:50,079 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:09:50,135 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:09:50,135 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:09:50,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:09:50,165 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:09:50,166 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:09:56,146 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 22:09:56,285 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:09:56,318 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-26 22:09:56,319 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 22:09:56,322 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-26 22:10:13,939 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-26 22:10:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-26 22:10:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:10:13,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:13,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:10:13,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-26 22:10:13,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:13,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3681296] [2019-12-26 22:10:13,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:14,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3681296] [2019-12-26 22:10:14,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:14,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:10:14,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90807] [2019-12-26 22:10:14,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:14,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:14,178 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-26 22:10:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:15,866 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-26 22:10:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:15,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:10:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:16,528 INFO L225 Difference]: With dead ends: 114158 [2019-12-26 22:10:16,528 INFO L226 Difference]: Without dead ends: 107060 [2019-12-26 22:10:16,530 INFO L631 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 [2019-12-26 22:10:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-26 22:10:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-26 22:10:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-26 22:10:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-26 22:10:32,646 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-26 22:10:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:32,646 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-26 22:10:32,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-26 22:10:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:10:32,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:32,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:32,651 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:32,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:32,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-26 22:10:32,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:32,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82651128] [2019-12-26 22:10:32,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:32,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82651128] [2019-12-26 22:10:32,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:32,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:32,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727543521] [2019-12-26 22:10:32,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:10:32,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:10:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:10:32,816 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-26 22:10:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:34,978 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-26 22:10:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:10:34,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:10:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:35,623 INFO L225 Difference]: With dead ends: 166396 [2019-12-26 22:10:35,623 INFO L226 Difference]: Without dead ends: 166347 [2019-12-26 22:10:35,624 INFO L631 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 [2019-12-26 22:10:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-26 22:10:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-26 22:10:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-26 22:10:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-26 22:10:49,537 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-26 22:10:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:49,538 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-26 22:10:49,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:10:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-26 22:10:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:10:49,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:49,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:49,545 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:49,546 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-26 22:10:49,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:49,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736511010] [2019-12-26 22:10:49,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:49,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736511010] [2019-12-26 22:10:49,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:49,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:49,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929415232] [2019-12-26 22:10:49,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:49,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:49,613 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-26 22:10:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:49,748 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-26 22:10:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:49,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:10:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:49,841 INFO L225 Difference]: With dead ends: 33114 [2019-12-26 22:10:49,842 INFO L226 Difference]: Without dead ends: 33114 [2019-12-26 22:10:49,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-26 22:10:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-26 22:10:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-26 22:10:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-26 22:10:50,595 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-26 22:10:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:50,596 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-26 22:10:50,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-26 22:10:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:10:50,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:50,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:50,599 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-26 22:10:50,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:50,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082034566] [2019-12-26 22:10:50,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:50,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082034566] [2019-12-26 22:10:50,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:50,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:50,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918913425] [2019-12-26 22:10:50,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:10:50,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:10:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:10:50,774 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-26 22:10:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:52,180 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-26 22:10:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:10:52,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:10:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:52,266 INFO L225 Difference]: With dead ends: 41561 [2019-12-26 22:10:52,266 INFO L226 Difference]: Without dead ends: 41561 [2019-12-26 22:10:52,267 INFO L631 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 [2019-12-26 22:10:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-26 22:10:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-26 22:10:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-26 22:10:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-26 22:10:53,083 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-26 22:10:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:53,084 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-26 22:10:53,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:10:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-26 22:10:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:10:53,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:53,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:53,096 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-26 22:10:53,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:53,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838858212] [2019-12-26 22:10:53,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:53,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838858212] [2019-12-26 22:10:53,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:53,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:10:53,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927353122] [2019-12-26 22:10:53,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:10:53,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:10:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:10:53,248 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-26 22:10:55,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:55,055 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-26 22:10:55,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:10:55,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:10:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:55,134 INFO L225 Difference]: With dead ends: 47941 [2019-12-26 22:10:55,134 INFO L226 Difference]: Without dead ends: 47934 [2019-12-26 22:10:55,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:10:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-26 22:10:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-26 22:10:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-26 22:10:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-26 22:10:55,854 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-26 22:10:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:55,855 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-26 22:10:55,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:10:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-26 22:10:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:10:55,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:55,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:55,870 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-26 22:10:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:55,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723298181] [2019-12-26 22:10:55,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:55,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723298181] [2019-12-26 22:10:55,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:55,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:10:55,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597738486] [2019-12-26 22:10:55,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:10:55,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:55,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:10:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:10:55,931 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 4 states. [2019-12-26 22:10:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:56,007 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-26 22:10:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:10:56,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:10:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:56,029 INFO L225 Difference]: With dead ends: 15264 [2019-12-26 22:10:56,029 INFO L226 Difference]: Without dead ends: 15264 [2019-12-26 22:10:56,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:10:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-26 22:10:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-26 22:10:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-26 22:10:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-26 22:10:58,312 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-26 22:10:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:58,313 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-26 22:10:58,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:10:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-26 22:10:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:10:58,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:58,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:58,325 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-26 22:10:58,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:58,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537249567] [2019-12-26 22:10:58,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:58,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537249567] [2019-12-26 22:10:58,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:58,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:10:58,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348522942] [2019-12-26 22:10:58,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:58,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:58,376 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-26 22:10:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:58,474 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-26 22:10:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:58,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:10:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:58,502 INFO L225 Difference]: With dead ends: 21267 [2019-12-26 22:10:58,502 INFO L226 Difference]: Without dead ends: 21267 [2019-12-26 22:10:58,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-26 22:10:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-26 22:10:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-26 22:10:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-26 22:10:58,776 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-26 22:10:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:58,777 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-26 22:10:58,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-26 22:10:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:10:58,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:58,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:58,787 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-26 22:10:58,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:58,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638932612] [2019-12-26 22:10:58,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638932612] [2019-12-26 22:10:58,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:58,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:10:58,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133647502] [2019-12-26 22:10:58,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:10:58,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:10:58,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:10:58,909 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-26 22:10:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:59,673 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-26 22:10:59,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:10:59,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:10:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:59,728 INFO L225 Difference]: With dead ends: 40724 [2019-12-26 22:10:59,728 INFO L226 Difference]: Without dead ends: 40724 [2019-12-26 22:10:59,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:10:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-26 22:11:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-26 22:11:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-26 22:11:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-26 22:11:00,395 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-26 22:11:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:00,396 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-26 22:11:00,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-26 22:11:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:11:00,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:00,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:00,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-26 22:11:00,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:00,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153590298] [2019-12-26 22:11:00,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:00,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153590298] [2019-12-26 22:11:00,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:00,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966883977] [2019-12-26 22:11:00,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:00,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:00,530 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 6 states. [2019-12-26 22:11:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:01,346 INFO L93 Difference]: Finished difference Result 37765 states and 113362 transitions. [2019-12-26 22:11:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:11:01,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 22:11:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:01,402 INFO L225 Difference]: With dead ends: 37765 [2019-12-26 22:11:01,403 INFO L226 Difference]: Without dead ends: 37765 [2019-12-26 22:11:01,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-12-26 22:11:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 22218. [2019-12-26 22:11:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-26 22:11:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 68697 transitions. [2019-12-26 22:11:01,874 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 68697 transitions. Word has length 28 [2019-12-26 22:11:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:01,875 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 68697 transitions. [2019-12-26 22:11:01,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 68697 transitions. [2019-12-26 22:11:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:11:01,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:01,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:01,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-26 22:11:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:01,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486991901] [2019-12-26 22:11:01,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:02,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486991901] [2019-12-26 22:11:02,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:02,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:02,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90804731] [2019-12-26 22:11:02,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:02,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:02,027 INFO L87 Difference]: Start difference. First operand 22218 states and 68697 transitions. Second operand 7 states. [2019-12-26 22:11:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:03,706 INFO L93 Difference]: Finished difference Result 50401 states and 150592 transitions. [2019-12-26 22:11:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:11:03,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:11:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:03,782 INFO L225 Difference]: With dead ends: 50401 [2019-12-26 22:11:03,782 INFO L226 Difference]: Without dead ends: 50401 [2019-12-26 22:11:03,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:11:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50401 states. [2019-12-26 22:11:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50401 to 23449. [2019-12-26 22:11:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23449 states. [2019-12-26 22:11:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23449 states to 23449 states and 72523 transitions. [2019-12-26 22:11:04,334 INFO L78 Accepts]: Start accepts. Automaton has 23449 states and 72523 transitions. Word has length 33 [2019-12-26 22:11:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:04,334 INFO L462 AbstractCegarLoop]: Abstraction has 23449 states and 72523 transitions. [2019-12-26 22:11:04,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23449 states and 72523 transitions. [2019-12-26 22:11:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:11:04,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:04,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:04,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826604, now seen corresponding path program 1 times [2019-12-26 22:11:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969307897] [2019-12-26 22:11:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:04,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969307897] [2019-12-26 22:11:04,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:04,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:04,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616195790] [2019-12-26 22:11:04,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:04,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:04,405 INFO L87 Difference]: Start difference. First operand 23449 states and 72523 transitions. Second operand 3 states. [2019-12-26 22:11:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:04,521 INFO L93 Difference]: Finished difference Result 31046 states and 92713 transitions. [2019-12-26 22:11:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:04,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-26 22:11:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:04,564 INFO L225 Difference]: With dead ends: 31046 [2019-12-26 22:11:04,564 INFO L226 Difference]: Without dead ends: 31046 [2019-12-26 22:11:04,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31046 states. [2019-12-26 22:11:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31046 to 22288. [2019-12-26 22:11:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22288 states. [2019-12-26 22:11:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 66690 transitions. [2019-12-26 22:11:05,147 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 66690 transitions. Word has length 33 [2019-12-26 22:11:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:05,147 INFO L462 AbstractCegarLoop]: Abstraction has 22288 states and 66690 transitions. [2019-12-26 22:11:05,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 66690 transitions. [2019-12-26 22:11:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:11:05,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:05,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:05,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-26 22:11:05,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:05,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058098556] [2019-12-26 22:11:05,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:05,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058098556] [2019-12-26 22:11:05,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:05,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:05,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620489449] [2019-12-26 22:11:05,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:11:05,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:11:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:11:05,296 INFO L87 Difference]: Start difference. First operand 22288 states and 66690 transitions. Second operand 8 states. [2019-12-26 22:11:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:07,171 INFO L93 Difference]: Finished difference Result 49099 states and 143360 transitions. [2019-12-26 22:11:07,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:11:07,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 22:11:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:07,238 INFO L225 Difference]: With dead ends: 49099 [2019-12-26 22:11:07,238 INFO L226 Difference]: Without dead ends: 49099 [2019-12-26 22:11:07,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:11:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49099 states. [2019-12-26 22:11:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49099 to 21685. [2019-12-26 22:11:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-12-26 22:11:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 64891 transitions. [2019-12-26 22:11:08,040 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 64891 transitions. Word has length 33 [2019-12-26 22:11:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:08,040 INFO L462 AbstractCegarLoop]: Abstraction has 21685 states and 64891 transitions. [2019-12-26 22:11:08,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:11:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 64891 transitions. [2019-12-26 22:11:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:11:08,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:08,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:08,060 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash 791261483, now seen corresponding path program 1 times [2019-12-26 22:11:08,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:08,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042433002] [2019-12-26 22:11:08,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:08,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042433002] [2019-12-26 22:11:08,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:08,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:08,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359466619] [2019-12-26 22:11:08,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:08,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:08,282 INFO L87 Difference]: Start difference. First operand 21685 states and 64891 transitions. Second operand 9 states. [2019-12-26 22:11:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:10,061 INFO L93 Difference]: Finished difference Result 39456 states and 115299 transitions. [2019-12-26 22:11:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 22:11:10,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-26 22:11:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:10,113 INFO L225 Difference]: With dead ends: 39456 [2019-12-26 22:11:10,113 INFO L226 Difference]: Without dead ends: 39456 [2019-12-26 22:11:10,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:11:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39456 states. [2019-12-26 22:11:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39456 to 21437. [2019-12-26 22:11:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21437 states. [2019-12-26 22:11:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21437 states to 21437 states and 64195 transitions. [2019-12-26 22:11:10,561 INFO L78 Accepts]: Start accepts. Automaton has 21437 states and 64195 transitions. Word has length 34 [2019-12-26 22:11:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:10,561 INFO L462 AbstractCegarLoop]: Abstraction has 21437 states and 64195 transitions. [2019-12-26 22:11:10,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 21437 states and 64195 transitions. [2019-12-26 22:11:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:11:10,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:10,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:10,583 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1281586677, now seen corresponding path program 2 times [2019-12-26 22:11:10,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:10,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053631449] [2019-12-26 22:11:10,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:10,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053631449] [2019-12-26 22:11:10,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:10,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:10,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193057427] [2019-12-26 22:11:10,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:10,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:10,700 INFO L87 Difference]: Start difference. First operand 21437 states and 64195 transitions. Second operand 7 states. [2019-12-26 22:11:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:12,395 INFO L93 Difference]: Finished difference Result 35917 states and 105493 transitions. [2019-12-26 22:11:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:11:12,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:11:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:12,464 INFO L225 Difference]: With dead ends: 35917 [2019-12-26 22:11:12,464 INFO L226 Difference]: Without dead ends: 35917 [2019-12-26 22:11:12,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:11:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35917 states. [2019-12-26 22:11:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35917 to 20324. [2019-12-26 22:11:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20324 states. [2019-12-26 22:11:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20324 states to 20324 states and 60908 transitions. [2019-12-26 22:11:13,164 INFO L78 Accepts]: Start accepts. Automaton has 20324 states and 60908 transitions. Word has length 34 [2019-12-26 22:11:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:13,164 INFO L462 AbstractCegarLoop]: Abstraction has 20324 states and 60908 transitions. [2019-12-26 22:11:13,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 20324 states and 60908 transitions. [2019-12-26 22:11:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:11:13,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:13,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:13,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:13,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1244987983, now seen corresponding path program 3 times [2019-12-26 22:11:13,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:13,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573207332] [2019-12-26 22:11:13,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:13,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573207332] [2019-12-26 22:11:13,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:13,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:13,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234989485] [2019-12-26 22:11:13,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:13,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:13,334 INFO L87 Difference]: Start difference. First operand 20324 states and 60908 transitions. Second operand 7 states. [2019-12-26 22:11:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:14,570 INFO L93 Difference]: Finished difference Result 46732 states and 135699 transitions. [2019-12-26 22:11:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:11:14,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:11:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:14,650 INFO L225 Difference]: With dead ends: 46732 [2019-12-26 22:11:14,650 INFO L226 Difference]: Without dead ends: 46732 [2019-12-26 22:11:14,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:11:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46732 states. [2019-12-26 22:11:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46732 to 19737. [2019-12-26 22:11:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19737 states. [2019-12-26 22:11:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19737 states to 19737 states and 59173 transitions. [2019-12-26 22:11:15,140 INFO L78 Accepts]: Start accepts. Automaton has 19737 states and 59173 transitions. Word has length 34 [2019-12-26 22:11:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:15,140 INFO L462 AbstractCegarLoop]: Abstraction has 19737 states and 59173 transitions. [2019-12-26 22:11:15,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19737 states and 59173 transitions. [2019-12-26 22:11:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:11:15,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:15,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:15,159 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -851207469, now seen corresponding path program 4 times [2019-12-26 22:11:15,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:15,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011957623] [2019-12-26 22:11:15,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:15,517 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-26 22:11:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:15,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011957623] [2019-12-26 22:11:15,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:15,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:15,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727676992] [2019-12-26 22:11:15,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:11:15,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:11:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:15,579 INFO L87 Difference]: Start difference. First operand 19737 states and 59173 transitions. Second operand 11 states. [2019-12-26 22:11:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:18,002 INFO L93 Difference]: Finished difference Result 42349 states and 123675 transitions. [2019-12-26 22:11:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:11:18,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-26 22:11:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:18,060 INFO L225 Difference]: With dead ends: 42349 [2019-12-26 22:11:18,060 INFO L226 Difference]: Without dead ends: 42349 [2019-12-26 22:11:18,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:11:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42349 states. [2019-12-26 22:11:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42349 to 19413. [2019-12-26 22:11:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19413 states. [2019-12-26 22:11:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19413 states to 19413 states and 58228 transitions. [2019-12-26 22:11:18,511 INFO L78 Accepts]: Start accepts. Automaton has 19413 states and 58228 transitions. Word has length 34 [2019-12-26 22:11:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:18,511 INFO L462 AbstractCegarLoop]: Abstraction has 19413 states and 58228 transitions. [2019-12-26 22:11:18,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:11:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19413 states and 58228 transitions. [2019-12-26 22:11:18,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:11:18,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:18,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:18,529 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:18,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1420266152, now seen corresponding path program 1 times [2019-12-26 22:11:18,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:18,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827281947] [2019-12-26 22:11:18,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:18,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827281947] [2019-12-26 22:11:18,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:18,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:11:18,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393956874] [2019-12-26 22:11:18,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:18,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:18,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:18,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:18,590 INFO L87 Difference]: Start difference. First operand 19413 states and 58228 transitions. Second operand 3 states. [2019-12-26 22:11:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:18,665 INFO L93 Difference]: Finished difference Result 19412 states and 58226 transitions. [2019-12-26 22:11:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:18,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:11:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:18,695 INFO L225 Difference]: With dead ends: 19412 [2019-12-26 22:11:18,696 INFO L226 Difference]: Without dead ends: 19412 [2019-12-26 22:11:18,696 INFO L631 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 [2019-12-26 22:11:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19412 states. [2019-12-26 22:11:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19412 to 19412. [2019-12-26 22:11:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19412 states. [2019-12-26 22:11:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19412 states to 19412 states and 58226 transitions. [2019-12-26 22:11:18,978 INFO L78 Accepts]: Start accepts. Automaton has 19412 states and 58226 transitions. Word has length 39 [2019-12-26 22:11:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:18,978 INFO L462 AbstractCegarLoop]: Abstraction has 19412 states and 58226 transitions. [2019-12-26 22:11:18,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 19412 states and 58226 transitions. [2019-12-26 22:11:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:11:19,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:19,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:19,001 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1015126435, now seen corresponding path program 1 times [2019-12-26 22:11:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246553096] [2019-12-26 22:11:19,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:19,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246553096] [2019-12-26 22:11:19,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:19,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:19,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820202160] [2019-12-26 22:11:19,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:19,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:19,191 INFO L87 Difference]: Start difference. First operand 19412 states and 58226 transitions. Second operand 3 states. [2019-12-26 22:11:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:19,333 INFO L93 Difference]: Finished difference Result 36821 states and 110495 transitions. [2019-12-26 22:11:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:19,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 22:11:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:19,369 INFO L225 Difference]: With dead ends: 36821 [2019-12-26 22:11:19,369 INFO L226 Difference]: Without dead ends: 19829 [2019-12-26 22:11:19,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2019-12-26 22:11:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 19763. [2019-12-26 22:11:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19763 states. [2019-12-26 22:11:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19763 states to 19763 states and 57956 transitions. [2019-12-26 22:11:19,690 INFO L78 Accepts]: Start accepts. Automaton has 19763 states and 57956 transitions. Word has length 40 [2019-12-26 22:11:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:19,690 INFO L462 AbstractCegarLoop]: Abstraction has 19763 states and 57956 transitions. [2019-12-26 22:11:19,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19763 states and 57956 transitions. [2019-12-26 22:11:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:11:19,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:19,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:19,709 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1234885869, now seen corresponding path program 2 times [2019-12-26 22:11:19,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:19,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604350567] [2019-12-26 22:11:19,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:19,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604350567] [2019-12-26 22:11:19,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:19,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:19,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153555212] [2019-12-26 22:11:19,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:19,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:19,769 INFO L87 Difference]: Start difference. First operand 19763 states and 57956 transitions. Second operand 5 states. [2019-12-26 22:11:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:20,368 INFO L93 Difference]: Finished difference Result 28152 states and 81728 transitions. [2019-12-26 22:11:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:11:20,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:11:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:20,405 INFO L225 Difference]: With dead ends: 28152 [2019-12-26 22:11:20,405 INFO L226 Difference]: Without dead ends: 28152 [2019-12-26 22:11:20,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28152 states. [2019-12-26 22:11:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28152 to 25718. [2019-12-26 22:11:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25718 states. [2019-12-26 22:11:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25718 states to 25718 states and 75196 transitions. [2019-12-26 22:11:20,790 INFO L78 Accepts]: Start accepts. Automaton has 25718 states and 75196 transitions. Word has length 40 [2019-12-26 22:11:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:20,790 INFO L462 AbstractCegarLoop]: Abstraction has 25718 states and 75196 transitions. [2019-12-26 22:11:20,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 25718 states and 75196 transitions. [2019-12-26 22:11:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:11:20,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:20,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:20,812 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 3 times [2019-12-26 22:11:20,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:20,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636968920] [2019-12-26 22:11:20,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:20,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636968920] [2019-12-26 22:11:20,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:20,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:20,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617595671] [2019-12-26 22:11:20,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:20,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:20,881 INFO L87 Difference]: Start difference. First operand 25718 states and 75196 transitions. Second operand 3 states. [2019-12-26 22:11:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:20,986 INFO L93 Difference]: Finished difference Result 25718 states and 75117 transitions. [2019-12-26 22:11:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:20,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 22:11:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:21,032 INFO L225 Difference]: With dead ends: 25718 [2019-12-26 22:11:21,033 INFO L226 Difference]: Without dead ends: 25718 [2019-12-26 22:11:21,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25718 states. [2019-12-26 22:11:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25718 to 21220. [2019-12-26 22:11:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-26 22:11:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 62629 transitions. [2019-12-26 22:11:21,596 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 62629 transitions. Word has length 40 [2019-12-26 22:11:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:21,596 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 62629 transitions. [2019-12-26 22:11:21,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 62629 transitions. [2019-12-26 22:11:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 22:11:21,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:21,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:21,615 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1862086557, now seen corresponding path program 1 times [2019-12-26 22:11:21,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:21,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816430152] [2019-12-26 22:11:21,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:21,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816430152] [2019-12-26 22:11:21,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:21,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:21,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405582651] [2019-12-26 22:11:21,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:21,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:21,675 INFO L87 Difference]: Start difference. First operand 21220 states and 62629 transitions. Second operand 5 states. [2019-12-26 22:11:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:21,761 INFO L93 Difference]: Finished difference Result 19954 states and 59903 transitions. [2019-12-26 22:11:21,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:21,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 22:11:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:21,792 INFO L225 Difference]: With dead ends: 19954 [2019-12-26 22:11:21,792 INFO L226 Difference]: Without dead ends: 18525 [2019-12-26 22:11:21,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18525 states. [2019-12-26 22:11:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18525 to 18525. [2019-12-26 22:11:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18525 states. [2019-12-26 22:11:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18525 states to 18525 states and 56857 transitions. [2019-12-26 22:11:22,066 INFO L78 Accepts]: Start accepts. Automaton has 18525 states and 56857 transitions. Word has length 41 [2019-12-26 22:11:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:22,067 INFO L462 AbstractCegarLoop]: Abstraction has 18525 states and 56857 transitions. [2019-12-26 22:11:22,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18525 states and 56857 transitions. [2019-12-26 22:11:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:22,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:22,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:22,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2069069209, now seen corresponding path program 1 times [2019-12-26 22:11:22,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:22,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659001248] [2019-12-26 22:11:22,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:22,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659001248] [2019-12-26 22:11:22,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:22,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:22,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327495652] [2019-12-26 22:11:22,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:22,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:22,168 INFO L87 Difference]: Start difference. First operand 18525 states and 56857 transitions. Second operand 7 states. [2019-12-26 22:11:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:22,785 INFO L93 Difference]: Finished difference Result 51721 states and 156972 transitions. [2019-12-26 22:11:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:11:22,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:11:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:22,869 INFO L225 Difference]: With dead ends: 51721 [2019-12-26 22:11:22,869 INFO L226 Difference]: Without dead ends: 36924 [2019-12-26 22:11:22,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:11:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36924 states. [2019-12-26 22:11:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36924 to 21892. [2019-12-26 22:11:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21892 states. [2019-12-26 22:11:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21892 states to 21892 states and 66659 transitions. [2019-12-26 22:11:23,677 INFO L78 Accepts]: Start accepts. Automaton has 21892 states and 66659 transitions. Word has length 65 [2019-12-26 22:11:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:23,677 INFO L462 AbstractCegarLoop]: Abstraction has 21892 states and 66659 transitions. [2019-12-26 22:11:23,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 21892 states and 66659 transitions. [2019-12-26 22:11:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:23,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:23,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:23,699 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 721729991, now seen corresponding path program 2 times [2019-12-26 22:11:23,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:23,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352487459] [2019-12-26 22:11:23,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:23,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352487459] [2019-12-26 22:11:23,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:23,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:23,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786542177] [2019-12-26 22:11:23,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:11:23,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:23,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:11:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:11:23,800 INFO L87 Difference]: Start difference. First operand 21892 states and 66659 transitions. Second operand 8 states. [2019-12-26 22:11:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:25,113 INFO L93 Difference]: Finished difference Result 77736 states and 236178 transitions. [2019-12-26 22:11:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:11:25,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:11:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:25,196 INFO L225 Difference]: With dead ends: 77736 [2019-12-26 22:11:25,197 INFO L226 Difference]: Without dead ends: 57942 [2019-12-26 22:11:25,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:11:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57942 states. [2019-12-26 22:11:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57942 to 25241. [2019-12-26 22:11:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25241 states. [2019-12-26 22:11:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25241 states to 25241 states and 76867 transitions. [2019-12-26 22:11:25,836 INFO L78 Accepts]: Start accepts. Automaton has 25241 states and 76867 transitions. Word has length 65 [2019-12-26 22:11:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:25,836 INFO L462 AbstractCegarLoop]: Abstraction has 25241 states and 76867 transitions. [2019-12-26 22:11:25,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:11:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 25241 states and 76867 transitions. [2019-12-26 22:11:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:25,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:25,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:25,861 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1898493973, now seen corresponding path program 3 times [2019-12-26 22:11:25,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:25,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236170864] [2019-12-26 22:11:25,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:25,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236170864] [2019-12-26 22:11:25,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:25,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:25,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41891653] [2019-12-26 22:11:25,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:25,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:25,964 INFO L87 Difference]: Start difference. First operand 25241 states and 76867 transitions. Second operand 9 states. [2019-12-26 22:11:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:27,299 INFO L93 Difference]: Finished difference Result 73985 states and 223479 transitions. [2019-12-26 22:11:27,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:11:27,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:11:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:27,401 INFO L225 Difference]: With dead ends: 73985 [2019-12-26 22:11:27,401 INFO L226 Difference]: Without dead ends: 71175 [2019-12-26 22:11:27,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:11:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71175 states. [2019-12-26 22:11:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71175 to 25393. [2019-12-26 22:11:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25393 states. [2019-12-26 22:11:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25393 states to 25393 states and 77372 transitions. [2019-12-26 22:11:28,450 INFO L78 Accepts]: Start accepts. Automaton has 25393 states and 77372 transitions. Word has length 65 [2019-12-26 22:11:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:28,450 INFO L462 AbstractCegarLoop]: Abstraction has 25393 states and 77372 transitions. [2019-12-26 22:11:28,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25393 states and 77372 transitions. [2019-12-26 22:11:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:28,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:28,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:28,476 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1422249589, now seen corresponding path program 4 times [2019-12-26 22:11:28,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:28,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200690276] [2019-12-26 22:11:28,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:28,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200690276] [2019-12-26 22:11:28,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:28,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:28,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39282246] [2019-12-26 22:11:28,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:28,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:28,596 INFO L87 Difference]: Start difference. First operand 25393 states and 77372 transitions. Second operand 9 states. [2019-12-26 22:11:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:29,906 INFO L93 Difference]: Finished difference Result 89561 states and 270139 transitions. [2019-12-26 22:11:29,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:11:29,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:11:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:30,033 INFO L225 Difference]: With dead ends: 89561 [2019-12-26 22:11:30,033 INFO L226 Difference]: Without dead ends: 86811 [2019-12-26 22:11:30,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:11:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86811 states. [2019-12-26 22:11:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86811 to 25608. [2019-12-26 22:11:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25608 states. [2019-12-26 22:11:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25608 states to 25608 states and 78192 transitions. [2019-12-26 22:11:31,139 INFO L78 Accepts]: Start accepts. Automaton has 25608 states and 78192 transitions. Word has length 65 [2019-12-26 22:11:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:31,140 INFO L462 AbstractCegarLoop]: Abstraction has 25608 states and 78192 transitions. [2019-12-26 22:11:31,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 25608 states and 78192 transitions. [2019-12-26 22:11:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:31,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:31,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:31,166 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1487237807, now seen corresponding path program 5 times [2019-12-26 22:11:31,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:31,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145227338] [2019-12-26 22:11:31,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:31,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145227338] [2019-12-26 22:11:31,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:31,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:31,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151623744] [2019-12-26 22:11:31,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:31,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:31,239 INFO L87 Difference]: Start difference. First operand 25608 states and 78192 transitions. Second operand 7 states. [2019-12-26 22:11:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:31,662 INFO L93 Difference]: Finished difference Result 49971 states and 150719 transitions. [2019-12-26 22:11:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:11:31,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:11:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:31,724 INFO L225 Difference]: With dead ends: 49971 [2019-12-26 22:11:31,724 INFO L226 Difference]: Without dead ends: 43240 [2019-12-26 22:11:31,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:11:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43240 states. [2019-12-26 22:11:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43240 to 25916. [2019-12-26 22:11:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25916 states. [2019-12-26 22:11:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25916 states to 25916 states and 79143 transitions. [2019-12-26 22:11:32,287 INFO L78 Accepts]: Start accepts. Automaton has 25916 states and 79143 transitions. Word has length 65 [2019-12-26 22:11:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:32,287 INFO L462 AbstractCegarLoop]: Abstraction has 25916 states and 79143 transitions. [2019-12-26 22:11:32,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25916 states and 79143 transitions. [2019-12-26 22:11:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:32,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:32,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:32,320 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1633035801, now seen corresponding path program 6 times [2019-12-26 22:11:32,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:32,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220452561] [2019-12-26 22:11:32,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:32,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220452561] [2019-12-26 22:11:32,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:32,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:32,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422170958] [2019-12-26 22:11:32,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:32,405 INFO L87 Difference]: Start difference. First operand 25916 states and 79143 transitions. Second operand 6 states. [2019-12-26 22:11:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:33,037 INFO L93 Difference]: Finished difference Result 27938 states and 84810 transitions. [2019-12-26 22:11:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:11:33,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 22:11:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:33,109 INFO L225 Difference]: With dead ends: 27938 [2019-12-26 22:11:33,110 INFO L226 Difference]: Without dead ends: 27938 [2019-12-26 22:11:33,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:11:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27938 states. [2019-12-26 22:11:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27938 to 26118. [2019-12-26 22:11:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26118 states. [2019-12-26 22:11:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26118 states to 26118 states and 79804 transitions. [2019-12-26 22:11:33,942 INFO L78 Accepts]: Start accepts. Automaton has 26118 states and 79804 transitions. Word has length 65 [2019-12-26 22:11:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:33,942 INFO L462 AbstractCegarLoop]: Abstraction has 26118 states and 79804 transitions. [2019-12-26 22:11:33,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 26118 states and 79804 transitions. [2019-12-26 22:11:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:33,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:33,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:33,972 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1872889737, now seen corresponding path program 7 times [2019-12-26 22:11:33,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:33,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708905752] [2019-12-26 22:11:33,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:34,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708905752] [2019-12-26 22:11:34,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:34,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:34,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406531276] [2019-12-26 22:11:34,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:34,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:34,074 INFO L87 Difference]: Start difference. First operand 26118 states and 79804 transitions. Second operand 6 states. [2019-12-26 22:11:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:34,777 INFO L93 Difference]: Finished difference Result 43445 states and 130331 transitions. [2019-12-26 22:11:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:11:34,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 22:11:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:34,836 INFO L225 Difference]: With dead ends: 43445 [2019-12-26 22:11:34,836 INFO L226 Difference]: Without dead ends: 43242 [2019-12-26 22:11:34,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43242 states. [2019-12-26 22:11:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43242 to 28448. [2019-12-26 22:11:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28448 states. [2019-12-26 22:11:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28448 states to 28448 states and 87186 transitions. [2019-12-26 22:11:35,389 INFO L78 Accepts]: Start accepts. Automaton has 28448 states and 87186 transitions. Word has length 65 [2019-12-26 22:11:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:35,389 INFO L462 AbstractCegarLoop]: Abstraction has 28448 states and 87186 transitions. [2019-12-26 22:11:35,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 28448 states and 87186 transitions. [2019-12-26 22:11:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:35,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:35,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:35,422 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:35,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash 190064407, now seen corresponding path program 8 times [2019-12-26 22:11:35,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:35,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608520638] [2019-12-26 22:11:35,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:35,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608520638] [2019-12-26 22:11:35,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:35,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:35,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642781015] [2019-12-26 22:11:35,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:35,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:35,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:35,497 INFO L87 Difference]: Start difference. First operand 28448 states and 87186 transitions. Second operand 4 states. [2019-12-26 22:11:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:35,697 INFO L93 Difference]: Finished difference Result 31762 states and 97514 transitions. [2019-12-26 22:11:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:35,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:11:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:35,772 INFO L225 Difference]: With dead ends: 31762 [2019-12-26 22:11:35,772 INFO L226 Difference]: Without dead ends: 31762 [2019-12-26 22:11:35,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31762 states. [2019-12-26 22:11:36,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31762 to 27376. [2019-12-26 22:11:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27376 states. [2019-12-26 22:11:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27376 states to 27376 states and 84647 transitions. [2019-12-26 22:11:36,569 INFO L78 Accepts]: Start accepts. Automaton has 27376 states and 84647 transitions. Word has length 65 [2019-12-26 22:11:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:36,569 INFO L462 AbstractCegarLoop]: Abstraction has 27376 states and 84647 transitions. [2019-12-26 22:11:36,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27376 states and 84647 transitions. [2019-12-26 22:11:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:36,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:36,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:36,597 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1891524338, now seen corresponding path program 1 times [2019-12-26 22:11:36,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:36,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164094671] [2019-12-26 22:11:36,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:36,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164094671] [2019-12-26 22:11:36,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:36,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:36,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136321917] [2019-12-26 22:11:36,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:36,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:36,648 INFO L87 Difference]: Start difference. First operand 27376 states and 84647 transitions. Second operand 4 states. [2019-12-26 22:11:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:36,966 INFO L93 Difference]: Finished difference Result 33360 states and 102687 transitions. [2019-12-26 22:11:36,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:11:36,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 22:11:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:37,046 INFO L225 Difference]: With dead ends: 33360 [2019-12-26 22:11:37,046 INFO L226 Difference]: Without dead ends: 33360 [2019-12-26 22:11:37,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33360 states. [2019-12-26 22:11:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33360 to 27950. [2019-12-26 22:11:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27950 states. [2019-12-26 22:11:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27950 states to 27950 states and 86488 transitions. [2019-12-26 22:11:37,606 INFO L78 Accepts]: Start accepts. Automaton has 27950 states and 86488 transitions. Word has length 66 [2019-12-26 22:11:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:37,607 INFO L462 AbstractCegarLoop]: Abstraction has 27950 states and 86488 transitions. [2019-12-26 22:11:37,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27950 states and 86488 transitions. [2019-12-26 22:11:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:37,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:37,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:37,635 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 297672093, now seen corresponding path program 1 times [2019-12-26 22:11:37,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:37,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169259773] [2019-12-26 22:11:37,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:37,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169259773] [2019-12-26 22:11:37,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:37,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:37,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809293565] [2019-12-26 22:11:37,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:11:37,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:11:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:11:37,748 INFO L87 Difference]: Start difference. First operand 27950 states and 86488 transitions. Second operand 8 states. [2019-12-26 22:11:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:38,756 INFO L93 Difference]: Finished difference Result 71923 states and 219754 transitions. [2019-12-26 22:11:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:11:38,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 22:11:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:38,849 INFO L225 Difference]: With dead ends: 71923 [2019-12-26 22:11:38,849 INFO L226 Difference]: Without dead ends: 66638 [2019-12-26 22:11:38,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:11:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66638 states. [2019-12-26 22:11:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66638 to 28139. [2019-12-26 22:11:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28139 states. [2019-12-26 22:11:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28139 states to 28139 states and 87223 transitions. [2019-12-26 22:11:39,809 INFO L78 Accepts]: Start accepts. Automaton has 28139 states and 87223 transitions. Word has length 66 [2019-12-26 22:11:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:39,809 INFO L462 AbstractCegarLoop]: Abstraction has 28139 states and 87223 transitions. [2019-12-26 22:11:39,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:11:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28139 states and 87223 transitions. [2019-12-26 22:11:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:39,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:39,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:39,838 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1233556685, now seen corresponding path program 2 times [2019-12-26 22:11:39,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:39,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508618537] [2019-12-26 22:11:39,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:39,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508618537] [2019-12-26 22:11:39,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:39,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:39,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662941211] [2019-12-26 22:11:39,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:39,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:39,963 INFO L87 Difference]: Start difference. First operand 28139 states and 87223 transitions. Second operand 9 states. [2019-12-26 22:11:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:41,435 INFO L93 Difference]: Finished difference Result 84961 states and 257637 transitions. [2019-12-26 22:11:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:11:41,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 22:11:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:41,541 INFO L225 Difference]: With dead ends: 84961 [2019-12-26 22:11:41,542 INFO L226 Difference]: Without dead ends: 77700 [2019-12-26 22:11:41,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:11:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77700 states. [2019-12-26 22:11:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77700 to 28284. [2019-12-26 22:11:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28284 states. [2019-12-26 22:11:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28284 states to 28284 states and 87061 transitions. [2019-12-26 22:11:42,356 INFO L78 Accepts]: Start accepts. Automaton has 28284 states and 87061 transitions. Word has length 66 [2019-12-26 22:11:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:42,356 INFO L462 AbstractCegarLoop]: Abstraction has 28284 states and 87061 transitions. [2019-12-26 22:11:42,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28284 states and 87061 transitions. [2019-12-26 22:11:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:42,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:42,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:42,385 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash -371655968, now seen corresponding path program 2 times [2019-12-26 22:11:42,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:42,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427877638] [2019-12-26 22:11:42,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:42,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427877638] [2019-12-26 22:11:42,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:42,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:42,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824361014] [2019-12-26 22:11:42,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:42,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:42,432 INFO L87 Difference]: Start difference. First operand 28284 states and 87061 transitions. Second operand 4 states. [2019-12-26 22:11:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:42,879 INFO L93 Difference]: Finished difference Result 42803 states and 131901 transitions. [2019-12-26 22:11:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:42,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 22:11:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:42,938 INFO L225 Difference]: With dead ends: 42803 [2019-12-26 22:11:42,938 INFO L226 Difference]: Without dead ends: 42803 [2019-12-26 22:11:42,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42803 states. [2019-12-26 22:11:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42803 to 29651. [2019-12-26 22:11:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29651 states. [2019-12-26 22:11:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29651 states to 29651 states and 91797 transitions. [2019-12-26 22:11:43,552 INFO L78 Accepts]: Start accepts. Automaton has 29651 states and 91797 transitions. Word has length 66 [2019-12-26 22:11:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:43,552 INFO L462 AbstractCegarLoop]: Abstraction has 29651 states and 91797 transitions. [2019-12-26 22:11:43,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29651 states and 91797 transitions. [2019-12-26 22:11:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:43,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:43,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:43,586 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1777437935, now seen corresponding path program 3 times [2019-12-26 22:11:43,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:43,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708684075] [2019-12-26 22:11:43,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:43,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708684075] [2019-12-26 22:11:43,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:43,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:43,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689755280] [2019-12-26 22:11:43,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:43,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:43,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:43,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:43,694 INFO L87 Difference]: Start difference. First operand 29651 states and 91797 transitions. Second operand 9 states. [2019-12-26 22:11:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:44,948 INFO L93 Difference]: Finished difference Result 75226 states and 228760 transitions. [2019-12-26 22:11:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:11:44,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 22:11:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:45,055 INFO L225 Difference]: With dead ends: 75226 [2019-12-26 22:11:45,056 INFO L226 Difference]: Without dead ends: 71883 [2019-12-26 22:11:45,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:11:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71883 states. [2019-12-26 22:11:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71883 to 28713. [2019-12-26 22:11:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28713 states. [2019-12-26 22:11:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28713 states to 28713 states and 89178 transitions. [2019-12-26 22:11:46,228 INFO L78 Accepts]: Start accepts. Automaton has 28713 states and 89178 transitions. Word has length 66 [2019-12-26 22:11:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:46,228 INFO L462 AbstractCegarLoop]: Abstraction has 28713 states and 89178 transitions. [2019-12-26 22:11:46,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 28713 states and 89178 transitions. [2019-12-26 22:11:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:46,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:46,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:46,264 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:46,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:46,264 INFO L82 PathProgramCache]: Analyzing trace with hash 208840204, now seen corresponding path program 1 times [2019-12-26 22:11:46,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:46,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455910414] [2019-12-26 22:11:46,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:46,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455910414] [2019-12-26 22:11:46,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:46,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:11:46,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791444727] [2019-12-26 22:11:46,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:11:46,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:11:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:11:46,505 INFO L87 Difference]: Start difference. First operand 28713 states and 89178 transitions. Second operand 12 states. [2019-12-26 22:11:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:51,903 INFO L93 Difference]: Finished difference Result 61056 states and 182789 transitions. [2019-12-26 22:11:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-26 22:11:51,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:11:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:51,986 INFO L225 Difference]: With dead ends: 61056 [2019-12-26 22:11:51,987 INFO L226 Difference]: Without dead ends: 61028 [2019-12-26 22:11:51,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2019-12-26 22:11:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61028 states. [2019-12-26 22:11:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61028 to 26891. [2019-12-26 22:11:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26891 states. [2019-12-26 22:11:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26891 states to 26891 states and 82916 transitions. [2019-12-26 22:11:52,939 INFO L78 Accepts]: Start accepts. Automaton has 26891 states and 82916 transitions. Word has length 66 [2019-12-26 22:11:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 26891 states and 82916 transitions. [2019-12-26 22:11:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:11:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 26891 states and 82916 transitions. [2019-12-26 22:11:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:52,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:52,970 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1800151628, now seen corresponding path program 2 times [2019-12-26 22:11:52,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693166559] [2019-12-26 22:11:52,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:53,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693166559] [2019-12-26 22:11:53,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:53,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:53,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690998308] [2019-12-26 22:11:53,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:53,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:53,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:53,027 INFO L87 Difference]: Start difference. First operand 26891 states and 82916 transitions. Second operand 3 states. [2019-12-26 22:11:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:53,097 INFO L93 Difference]: Finished difference Result 21694 states and 65653 transitions. [2019-12-26 22:11:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:53,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:11:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:53,124 INFO L225 Difference]: With dead ends: 21694 [2019-12-26 22:11:53,124 INFO L226 Difference]: Without dead ends: 21694 [2019-12-26 22:11:53,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21694 states. [2019-12-26 22:11:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21694 to 20504. [2019-12-26 22:11:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20504 states. [2019-12-26 22:11:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20504 states to 20504 states and 62025 transitions. [2019-12-26 22:11:53,430 INFO L78 Accepts]: Start accepts. Automaton has 20504 states and 62025 transitions. Word has length 66 [2019-12-26 22:11:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:53,430 INFO L462 AbstractCegarLoop]: Abstraction has 20504 states and 62025 transitions. [2019-12-26 22:11:53,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20504 states and 62025 transitions. [2019-12-26 22:11:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:11:53,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:53,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:53,454 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2050480149, now seen corresponding path program 1 times [2019-12-26 22:11:53,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:53,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320124129] [2019-12-26 22:11:53,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:53,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320124129] [2019-12-26 22:11:53,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:53,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:53,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455048659] [2019-12-26 22:11:53,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:11:53,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:53,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:11:53,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:11:53,595 INFO L87 Difference]: Start difference. First operand 20504 states and 62025 transitions. Second operand 10 states. [2019-12-26 22:11:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:54,589 INFO L93 Difference]: Finished difference Result 46287 states and 140478 transitions. [2019-12-26 22:11:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:11:54,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 22:11:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:54,653 INFO L225 Difference]: With dead ends: 46287 [2019-12-26 22:11:54,653 INFO L226 Difference]: Without dead ends: 43655 [2019-12-26 22:11:54,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-26 22:11:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43655 states. [2019-12-26 22:11:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43655 to 25279. [2019-12-26 22:11:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25279 states. [2019-12-26 22:11:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25279 states to 25279 states and 76203 transitions. [2019-12-26 22:11:55,194 INFO L78 Accepts]: Start accepts. Automaton has 25279 states and 76203 transitions. Word has length 67 [2019-12-26 22:11:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:55,194 INFO L462 AbstractCegarLoop]: Abstraction has 25279 states and 76203 transitions. [2019-12-26 22:11:55,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:11:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25279 states and 76203 transitions. [2019-12-26 22:11:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:11:55,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:55,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:55,220 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 13478945, now seen corresponding path program 2 times [2019-12-26 22:11:55,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:55,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026173535] [2019-12-26 22:11:55,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:55,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026173535] [2019-12-26 22:11:55,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:55,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:55,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586080166] [2019-12-26 22:11:55,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:11:55,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:55,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:11:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:11:55,352 INFO L87 Difference]: Start difference. First operand 25279 states and 76203 transitions. Second operand 10 states. [2019-12-26 22:11:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:56,208 INFO L93 Difference]: Finished difference Result 44394 states and 133443 transitions. [2019-12-26 22:11:56,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:11:56,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 22:11:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:56,256 INFO L225 Difference]: With dead ends: 44394 [2019-12-26 22:11:56,256 INFO L226 Difference]: Without dead ends: 35765 [2019-12-26 22:11:56,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:11:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35765 states. [2019-12-26 22:11:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35765 to 20747. [2019-12-26 22:11:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20747 states. [2019-12-26 22:11:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20747 states to 20747 states and 62325 transitions. [2019-12-26 22:11:56,854 INFO L78 Accepts]: Start accepts. Automaton has 20747 states and 62325 transitions. Word has length 67 [2019-12-26 22:11:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:56,855 INFO L462 AbstractCegarLoop]: Abstraction has 20747 states and 62325 transitions. [2019-12-26 22:11:56,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:11:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 62325 transitions. [2019-12-26 22:11:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:11:56,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:56,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:56,879 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1111193301, now seen corresponding path program 3 times [2019-12-26 22:11:56,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:56,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102668315] [2019-12-26 22:11:56,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:57,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102668315] [2019-12-26 22:11:57,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:57,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:57,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95528856] [2019-12-26 22:11:57,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:11:57,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:11:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:57,067 INFO L87 Difference]: Start difference. First operand 20747 states and 62325 transitions. Second operand 11 states. [2019-12-26 22:11:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:58,114 INFO L93 Difference]: Finished difference Result 40033 states and 121197 transitions. [2019-12-26 22:11:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:11:58,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:11:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:58,166 INFO L225 Difference]: With dead ends: 40033 [2019-12-26 22:11:58,166 INFO L226 Difference]: Without dead ends: 38654 [2019-12-26 22:11:58,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:11:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38654 states. [2019-12-26 22:11:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38654 to 24622. [2019-12-26 22:11:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24622 states. [2019-12-26 22:11:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24622 states to 24622 states and 73834 transitions. [2019-12-26 22:11:58,653 INFO L78 Accepts]: Start accepts. Automaton has 24622 states and 73834 transitions. Word has length 67 [2019-12-26 22:11:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:58,653 INFO L462 AbstractCegarLoop]: Abstraction has 24622 states and 73834 transitions. [2019-12-26 22:11:58,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:11:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 24622 states and 73834 transitions. [2019-12-26 22:11:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:11:58,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:58,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:58,679 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1179614883, now seen corresponding path program 4 times [2019-12-26 22:11:58,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:58,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853879940] [2019-12-26 22:11:58,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:58,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853879940] [2019-12-26 22:11:58,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:58,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:58,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162635555] [2019-12-26 22:11:58,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:11:58,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:11:58,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:58,846 INFO L87 Difference]: Start difference. First operand 24622 states and 73834 transitions. Second operand 11 states. [2019-12-26 22:11:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:59,767 INFO L93 Difference]: Finished difference Result 39452 states and 118453 transitions. [2019-12-26 22:11:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:11:59,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:11:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:59,814 INFO L225 Difference]: With dead ends: 39452 [2019-12-26 22:11:59,814 INFO L226 Difference]: Without dead ends: 34874 [2019-12-26 22:11:59,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:11:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34874 states. [2019-12-26 22:12:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34874 to 20607. [2019-12-26 22:12:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20607 states. [2019-12-26 22:12:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20607 states to 20607 states and 61853 transitions. [2019-12-26 22:12:00,369 INFO L78 Accepts]: Start accepts. Automaton has 20607 states and 61853 transitions. Word has length 67 [2019-12-26 22:12:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:12:00,369 INFO L462 AbstractCegarLoop]: Abstraction has 20607 states and 61853 transitions. [2019-12-26 22:12:00,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:12:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 20607 states and 61853 transitions. [2019-12-26 22:12:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:12:00,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:12:00,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:12:00,388 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:12:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:12:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash 765672949, now seen corresponding path program 5 times [2019-12-26 22:12:00,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:12:00,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801543490] [2019-12-26 22:12:00,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:12:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:12:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:12:00,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801543490] [2019-12-26 22:12:00,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:12:00,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:12:00,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014332220] [2019-12-26 22:12:00,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:12:00,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:12:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:12:00,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:12:00,598 INFO L87 Difference]: Start difference. First operand 20607 states and 61853 transitions. Second operand 12 states. [2019-12-26 22:12:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:12:01,602 INFO L93 Difference]: Finished difference Result 35433 states and 106458 transitions. [2019-12-26 22:12:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:12:01,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 22:12:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:12:01,647 INFO L225 Difference]: With dead ends: 35433 [2019-12-26 22:12:01,647 INFO L226 Difference]: Without dead ends: 34600 [2019-12-26 22:12:01,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:12:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34600 states. [2019-12-26 22:12:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34600 to 20077. [2019-12-26 22:12:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20077 states. [2019-12-26 22:12:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20077 states to 20077 states and 60381 transitions. [2019-12-26 22:12:02,028 INFO L78 Accepts]: Start accepts. Automaton has 20077 states and 60381 transitions. Word has length 67 [2019-12-26 22:12:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:12:02,029 INFO L462 AbstractCegarLoop]: Abstraction has 20077 states and 60381 transitions. [2019-12-26 22:12:02,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:12:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 20077 states and 60381 transitions. [2019-12-26 22:12:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:12:02,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:12:02,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:12:02,048 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:12:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:12:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 6 times [2019-12-26 22:12:02,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:12:02,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772952210] [2019-12-26 22:12:02,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:12:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:12:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:12:02,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:12:02,164 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:12:02,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t751~0.offset_29|) (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t751~0.base_43|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t751~0.base_43| 1) |v_#valid_80|) (= v_~__unbuffered_p2_EBX~0_70 0) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= v_~z$w_buff1_used~0_670 0) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t751~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t751~0.base_43|) |v_ULTIMATE.start_main_~#t751~0.offset_29| 0)) |v_#memory_int_17|) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t751~0.base_43| 4)) (= v_~weak$$choice2~0_160 0) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t751~0.base_43|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t751~0.base=|v_ULTIMATE.start_main_~#t751~0.base_43|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t751~0.offset=|v_ULTIMATE.start_main_~#t751~0.offset_29|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ULTIMATE.start_main_~#t753~0.base=|v_ULTIMATE.start_main_~#t753~0.base_29|, ~x~0=v_~x~0_150, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ULTIMATE.start_main_~#t752~0.base=|v_ULTIMATE.start_main_~#t752~0.base_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_~#t753~0.offset=|v_ULTIMATE.start_main_~#t753~0.offset_21|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t752~0.offset=|v_ULTIMATE.start_main_~#t752~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_~#t751~0.base, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t752~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t751~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t753~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t752~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t753~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 22:12:02,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t752~0.offset_10|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t752~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t752~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t752~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t752~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t752~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t752~0.base_11|) |v_ULTIMATE.start_main_~#t752~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t752~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t752~0.base=|v_ULTIMATE.start_main_~#t752~0.base_11|, ULTIMATE.start_main_~#t752~0.offset=|v_ULTIMATE.start_main_~#t752~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t752~0.base, ULTIMATE.start_main_~#t752~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:12:02,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~z$w_buff0_used~0_174 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= (mod v_~z$w_buff1_used~0_104 256) 0) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:12:02,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t753~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t753~0.base_10|) |v_ULTIMATE.start_main_~#t753~0.offset_9| 2)) |v_#memory_int_11|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t753~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t753~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t753~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t753~0.base_10|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t753~0.base_10| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t753~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t753~0.offset=|v_ULTIMATE.start_main_~#t753~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t753~0.base=|v_ULTIMATE.start_main_~#t753~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t753~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t753~0.base] because there is no mapped edge [2019-12-26 22:12:02,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1050763981 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1050763981 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1050763981 |P1Thread1of1ForFork1_#t~ite9_Out-1050763981|)) (and (= ~z$w_buff1~0_In-1050763981 |P1Thread1of1ForFork1_#t~ite9_Out-1050763981|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1050763981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050763981, ~z$w_buff1~0=~z$w_buff1~0_In-1050763981, ~z~0=~z~0_In-1050763981} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1050763981|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1050763981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050763981, ~z$w_buff1~0=~z$w_buff1~0_In-1050763981, ~z~0=~z~0_In-1050763981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 22:12:02,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1087242938 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1087242938 256) 0))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1087242938 256))) (= (mod ~z$w_buff0_used~0_In1087242938 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In1087242938 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite20_Out1087242938| ~z$w_buff0~0_In1087242938) (= |P2Thread1of1ForFork2_#t~ite21_Out1087242938| |P2Thread1of1ForFork2_#t~ite20_Out1087242938|)) (and (= |P2Thread1of1ForFork2_#t~ite20_In1087242938| |P2Thread1of1ForFork2_#t~ite20_Out1087242938|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite21_Out1087242938| ~z$w_buff0~0_In1087242938)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1087242938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1087242938, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In1087242938|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1087242938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1087242938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1087242938, ~weak$$choice2~0=~weak$$choice2~0_In1087242938} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1087242938, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1087242938|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1087242938, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out1087242938|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1087242938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1087242938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1087242938, ~weak$$choice2~0=~weak$$choice2~0_In1087242938} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 22:12:02,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1809014556 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1809014556 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1809014556|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1809014556 |P0Thread1of1ForFork0_#t~ite5_Out-1809014556|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809014556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1809014556} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1809014556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809014556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1809014556} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:12:02,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-1323231876 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1323231876 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1323231876 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1323231876 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1323231876| ~z$w_buff1_used~0_In-1323231876) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1323231876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323231876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1323231876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323231876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1323231876} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1323231876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323231876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1323231876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323231876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1323231876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:12:02,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In212748244 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In212748244 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out212748244 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In212748244 ~z$r_buff0_thd1~0_Out212748244)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In212748244, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In212748244} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In212748244, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out212748244|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out212748244} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:12:02,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1531381462 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1531381462 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1531381462 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1531381462 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1531381462| ~z$r_buff1_thd1~0_In-1531381462)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1531381462| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1531381462, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1531381462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1531381462, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1531381462} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1531381462, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1531381462|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1531381462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1531381462, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1531381462} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:12:02,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:12:02,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1841743232 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out1841743232| ~z$w_buff1~0_In1841743232) (= |P2Thread1of1ForFork2_#t~ite23_In1841743232| |P2Thread1of1ForFork2_#t~ite23_Out1841743232|) (not .cse0)) (and .cse0 (= ~z$w_buff1~0_In1841743232 |P2Thread1of1ForFork2_#t~ite23_Out1841743232|) (= |P2Thread1of1ForFork2_#t~ite24_Out1841743232| |P2Thread1of1ForFork2_#t~ite23_Out1841743232|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1841743232 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1841743232 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1841743232 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1841743232 256)))))))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1841743232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1841743232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1841743232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1841743232, ~z$w_buff1~0=~z$w_buff1~0_In1841743232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1841743232, ~weak$$choice2~0=~weak$$choice2~0_In1841743232} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1841743232|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1841743232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1841743232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1841743232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1841743232, ~z$w_buff1~0=~z$w_buff1~0_In1841743232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1841743232, ~weak$$choice2~0=~weak$$choice2~0_In1841743232} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 22:12:02,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In500004059 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In500004059 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In500004059 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In500004059 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In500004059 256)) .cse0))) (= ~z$w_buff0_used~0_In500004059 |P2Thread1of1ForFork2_#t~ite26_Out500004059|) .cse1 (= |P2Thread1of1ForFork2_#t~ite26_Out500004059| |P2Thread1of1ForFork2_#t~ite27_Out500004059|)) (and (= ~z$w_buff0_used~0_In500004059 |P2Thread1of1ForFork2_#t~ite27_Out500004059|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In500004059| |P2Thread1of1ForFork2_#t~ite26_Out500004059|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In500004059|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In500004059, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In500004059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In500004059, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In500004059, ~weak$$choice2~0=~weak$$choice2~0_In500004059} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out500004059|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In500004059, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In500004059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In500004059, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In500004059, ~weak$$choice2~0=~weak$$choice2~0_In500004059, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out500004059|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-26 22:12:02,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:12:02,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 22:12:02,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1938063767 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1938063767 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1938063767| ~z$w_buff0_used~0_In1938063767) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1938063767|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1938063767, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1938063767} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1938063767, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1938063767|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1938063767} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:12:02,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In944832165 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In944832165 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In944832165 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In944832165 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out944832165| ~z$w_buff1_used~0_In944832165) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out944832165| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In944832165, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In944832165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In944832165, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In944832165} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In944832165, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In944832165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In944832165, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out944832165|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In944832165} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:12:02,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-685532807 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-685532807 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-685532807| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-685532807| ~z$r_buff0_thd2~0_In-685532807)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-685532807, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-685532807} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-685532807, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-685532807|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-685532807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 22:12:02,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:12:02,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In496240666 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In496240666 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out496240666| |P2Thread1of1ForFork2_#t~ite38_Out496240666|))) (or (and (not .cse0) (= ~z$w_buff1~0_In496240666 |P2Thread1of1ForFork2_#t~ite38_Out496240666|) (not .cse1) .cse2) (and (= ~z~0_In496240666 |P2Thread1of1ForFork2_#t~ite38_Out496240666|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496240666, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496240666, ~z$w_buff1~0=~z$w_buff1~0_In496240666, ~z~0=~z~0_In496240666} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496240666, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496240666, ~z$w_buff1~0=~z$w_buff1~0_In496240666, ~z~0=~z~0_In496240666, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out496240666|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out496240666|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-26 22:12:02,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In123705831 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In123705831 256) 0))) (or (and (= ~z$w_buff0_used~0_In123705831 |P2Thread1of1ForFork2_#t~ite40_Out123705831|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out123705831|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In123705831, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In123705831} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In123705831, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In123705831, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out123705831|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-26 22:12:02,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-287117004 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-287117004 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-287117004 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-287117004 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-287117004| ~z$w_buff1_used~0_In-287117004) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite41_Out-287117004| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-287117004, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-287117004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-287117004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-287117004} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-287117004|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-287117004, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-287117004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-287117004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-287117004} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-26 22:12:02,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1641501946 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1641501946 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1641501946 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1641501946 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1641501946| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1641501946| ~z$r_buff1_thd2~0_In1641501946) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1641501946, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1641501946, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1641501946, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1641501946} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1641501946, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1641501946, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1641501946, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1641501946|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1641501946} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:12:02,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_70) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:12:02,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1546674284 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1546674284 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1546674284|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1546674284 |P2Thread1of1ForFork2_#t~ite42_Out-1546674284|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1546674284, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1546674284} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1546674284|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1546674284, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1546674284} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-26 22:12:02,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1811968540 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1811968540 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1811968540 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1811968540 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1811968540 |P2Thread1of1ForFork2_#t~ite43_Out1811968540|)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out1811968540| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1811968540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1811968540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1811968540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1811968540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1811968540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1811968540, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1811968540|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1811968540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1811968540} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-26 22:12:02,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:12:02,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:12:02,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1671431857| |ULTIMATE.start_main_#t~ite48_Out1671431857|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1671431857 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1671431857 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1671431857| ~z$w_buff1~0_In1671431857) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out1671431857| ~z~0_In1671431857) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1671431857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1671431857, ~z$w_buff1~0=~z$w_buff1~0_In1671431857, ~z~0=~z~0_In1671431857} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1671431857, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1671431857|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1671431857, ~z$w_buff1~0=~z$w_buff1~0_In1671431857, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1671431857|, ~z~0=~z~0_In1671431857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:12:02,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-864101001 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-864101001 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-864101001| ~z$w_buff0_used~0_In-864101001)) (and (= |ULTIMATE.start_main_#t~ite49_Out-864101001| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-864101001, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-864101001} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-864101001, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-864101001, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-864101001|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:12:02,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1049431897 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1049431897 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1049431897 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1049431897 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1049431897| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out-1049431897| ~z$w_buff1_used~0_In-1049431897)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1049431897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1049431897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1049431897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1049431897} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1049431897|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1049431897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1049431897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1049431897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1049431897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:12:02,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1097816029 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1097816029 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1097816029|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1097816029 |ULTIMATE.start_main_#t~ite51_Out1097816029|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1097816029, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1097816029} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1097816029, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1097816029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1097816029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:12:02,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-87332854 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-87332854 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-87332854 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-87332854 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-87332854|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-87332854 |ULTIMATE.start_main_#t~ite52_Out-87332854|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-87332854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-87332854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-87332854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-87332854} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-87332854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-87332854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-87332854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-87332854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-87332854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:12:02,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117) (= v_~main$tmp_guard1~0_27 0) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:12:02,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:12:02 BasicIcfg [2019-12-26 22:12:02,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:12:02,321 INFO L168 Benchmark]: Toolchain (without parser) took 134311.40 ms. Allocated memory was 144.2 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 100.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,321 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.92 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 154.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,322 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,322 INFO L168 Benchmark]: Boogie Preprocessor took 54.37 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,322 INFO L168 Benchmark]: RCFGBuilder took 840.35 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,323 INFO L168 Benchmark]: TraceAbstraction took 132641.63 ms. Allocated memory was 201.3 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 98.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:12:02,326 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 705.92 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 154.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.37 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.35 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132641.63 ms. Allocated memory was 201.3 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 98.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t751, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t752, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t753, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 132.2s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 45.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11516 SDtfs, 17526 SDslu, 42065 SDs, 0 SdLazy, 20776 SolverSat, 826 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 66 SyntacticMatches, 33 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 677261 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1991 NumberOfCodeBlocks, 1991 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1883 ConstructedInterpolants, 0 QuantifiedInterpolants, 449581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...