/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:37:16,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:37:16,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:37:16,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:37:16,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:37:16,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:37:16,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:37:16,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:37:16,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:37:16,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:37:16,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:37:16,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:37:16,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:37:16,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:37:16,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:37:16,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:37:16,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:37:16,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:37:16,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:37:16,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:37:16,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:37:16,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:37:16,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:37:16,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:37:16,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:37:16,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:37:16,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:37:16,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:37:16,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:37:16,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:37:16,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:37:16,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:37:16,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:37:16,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:37:16,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:37:16,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:37:16,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:37:16,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:37:16,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:37:16,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:37:16,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:37:16,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:37:16,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:37:16,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:37:16,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:37:16,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:37:16,870 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:37:16,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:37:16,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:37:16,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:37:16,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:37:16,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:37:16,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:37:16,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:37:16,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:37:16,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:37:16,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:37:16,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:37:16,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:37:16,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:37:16,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:37:16,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:37:16,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:37:16,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:37:16,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:37:16,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:37:16,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:37:16,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:37:16,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:37:16,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:37:16,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:37:17,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:37:17,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:37:17,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:37:17,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:37:17,166 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:37:17,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 03:37:17,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6079244f9/0206f44bef8340f889f61a2b6f6028b8/FLAG50ace38ec [2019-12-27 03:37:17,852 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:37:17,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 03:37:17,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6079244f9/0206f44bef8340f889f61a2b6f6028b8/FLAG50ace38ec [2019-12-27 03:37:18,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6079244f9/0206f44bef8340f889f61a2b6f6028b8 [2019-12-27 03:37:18,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:37:18,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:37:18,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:37:18,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:37:18,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:37:18,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18, skipping insertion in model container [2019-12-27 03:37:18,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:37:18,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:37:18,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:37:18,699 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:37:18,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:37:18,854 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:37:18,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18 WrapperNode [2019-12-27 03:37:18,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:37:18,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:37:18,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:37:18,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:37:18,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:37:18,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:37:18,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:37:18,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:37:18,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (1/1) ... [2019-12-27 03:37:18,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:37:18,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:37:18,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:37:18,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:37:18,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (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-27 03:37:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:37:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:37:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:37:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:37:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:37:19,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:37:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:37:19,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:37:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:37:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:37:19,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:37:19,053 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:37:19,767 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:37:19,767 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:37:19,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:37:19 BoogieIcfgContainer [2019-12-27 03:37:19,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:37:19,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:37:19,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:37:19,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:37:19,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:37:18" (1/3) ... [2019-12-27 03:37:19,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a38cb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:37:19, skipping insertion in model container [2019-12-27 03:37:19,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:18" (2/3) ... [2019-12-27 03:37:19,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a38cb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:37:19, skipping insertion in model container [2019-12-27 03:37:19,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:37:19" (3/3) ... [2019-12-27 03:37:19,777 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-12-27 03:37:19,787 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:37:19,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:37:19,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:37:19,797 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:37:19,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,833 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,833 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,858 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,859 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:19,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:37:19,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:37:19,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:37:19,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:37:19,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:37:19,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:37:19,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:37:19,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:37:19,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:37:19,911 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 03:37:19,913 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 03:37:20,042 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 03:37:20,042 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:37:20,058 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:37:20,074 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 03:37:20,135 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 03:37:20,135 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:37:20,140 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:37:20,152 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 03:37:20,154 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:37:25,307 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 03:37:25,459 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 03:37:25,527 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-27 03:37:25,536 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 03:37:25,542 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-27 03:37:26,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-27 03:37:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-27 03:37:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:37:26,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:26,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:37:26,166 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-27 03:37:26,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:26,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850908816] [2019-12-27 03:37:26,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:26,437 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-27 03:37:26,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850908816] [2019-12-27 03:37:26,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:26,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:37:26,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661906577] [2019-12-27 03:37:26,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:26,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:26,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:26,462 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-27 03:37:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:26,707 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-27 03:37:26,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:26,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:37:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:26,802 INFO L225 Difference]: With dead ends: 8604 [2019-12-27 03:37:26,803 INFO L226 Difference]: Without dead ends: 8436 [2019-12-27 03:37:26,804 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-27 03:37:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-27 03:37:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-27 03:37:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-27 03:37:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-27 03:37:27,393 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-27 03:37:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:27,393 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-27 03:37:27,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-27 03:37:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:37:27,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:27,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:27,398 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-27 03:37:27,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:27,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189397849] [2019-12-27 03:37:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:27,533 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-27 03:37:27,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189397849] [2019-12-27 03:37:27,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:27,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:27,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763061726] [2019-12-27 03:37:27,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:27,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:27,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:27,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:27,537 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-27 03:37:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:27,938 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-27 03:37:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:27,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:37:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:28,029 INFO L225 Difference]: With dead ends: 13130 [2019-12-27 03:37:28,029 INFO L226 Difference]: Without dead ends: 13123 [2019-12-27 03:37:28,032 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-27 03:37:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-27 03:37:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-27 03:37:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-27 03:37:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-27 03:37:29,162 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-27 03:37:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:29,163 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-27 03:37:29,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-27 03:37:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:37:29,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:29,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:29,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:29,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-27 03:37:29,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:29,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363855389] [2019-12-27 03:37:29,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:29,302 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-27 03:37:29,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363855389] [2019-12-27 03:37:29,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:29,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:29,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180708923] [2019-12-27 03:37:29,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:29,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:29,304 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-27 03:37:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:29,542 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-27 03:37:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:29,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:37:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:29,591 INFO L225 Difference]: With dead ends: 14736 [2019-12-27 03:37:29,591 INFO L226 Difference]: Without dead ends: 14736 [2019-12-27 03:37:29,592 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-27 03:37:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-27 03:37:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-27 03:37:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-27 03:37:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-27 03:37:29,988 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-27 03:37:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:29,988 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-27 03:37:29,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-27 03:37:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:37:29,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:29,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:29,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-27 03:37:29,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:29,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671591089] [2019-12-27 03:37:29,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:30,266 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-27 03:37:30,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671591089] [2019-12-27 03:37:30,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:30,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:37:30,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809611537] [2019-12-27 03:37:30,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:37:30,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:37:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:30,269 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 7 states. [2019-12-27 03:37:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:31,066 INFO L93 Difference]: Finished difference Result 19406 states and 59946 transitions. [2019-12-27 03:37:31,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:37:31,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 03:37:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:31,123 INFO L225 Difference]: With dead ends: 19406 [2019-12-27 03:37:31,123 INFO L226 Difference]: Without dead ends: 19399 [2019-12-27 03:37:31,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:37:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19399 states. [2019-12-27 03:37:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19399 to 12884. [2019-12-27 03:37:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12884 states. [2019-12-27 03:37:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12884 states to 12884 states and 40783 transitions. [2019-12-27 03:37:31,657 INFO L78 Accepts]: Start accepts. Automaton has 12884 states and 40783 transitions. Word has length 17 [2019-12-27 03:37:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:31,657 INFO L462 AbstractCegarLoop]: Abstraction has 12884 states and 40783 transitions. [2019-12-27 03:37:31,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:37:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 12884 states and 40783 transitions. [2019-12-27 03:37:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 03:37:31,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:31,665 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] [2019-12-27 03:37:31,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1854056399, now seen corresponding path program 1 times [2019-12-27 03:37:31,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:31,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041650632] [2019-12-27 03:37:31,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:31,838 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-27 03:37:31,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041650632] [2019-12-27 03:37:31,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:31,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:37:31,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946454796] [2019-12-27 03:37:31,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:37:31,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:31,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:37:31,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:31,842 INFO L87 Difference]: Start difference. First operand 12884 states and 40783 transitions. Second operand 7 states. [2019-12-27 03:37:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:32,472 INFO L93 Difference]: Finished difference Result 16608 states and 51423 transitions. [2019-12-27 03:37:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:37:32,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-27 03:37:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:32,502 INFO L225 Difference]: With dead ends: 16608 [2019-12-27 03:37:32,502 INFO L226 Difference]: Without dead ends: 16608 [2019-12-27 03:37:32,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:37:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16608 states. [2019-12-27 03:37:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16608 to 12901. [2019-12-27 03:37:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12901 states. [2019-12-27 03:37:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12901 states to 12901 states and 40782 transitions. [2019-12-27 03:37:33,885 INFO L78 Accepts]: Start accepts. Automaton has 12901 states and 40782 transitions. Word has length 21 [2019-12-27 03:37:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:33,886 INFO L462 AbstractCegarLoop]: Abstraction has 12901 states and 40782 transitions. [2019-12-27 03:37:33,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:37:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12901 states and 40782 transitions. [2019-12-27 03:37:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:37:33,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:33,905 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-27 03:37:33,905 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-27 03:37:33,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:33,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793881545] [2019-12-27 03:37:33,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:34,017 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-27 03:37:34,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793881545] [2019-12-27 03:37:34,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:34,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:34,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003405696] [2019-12-27 03:37:34,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:34,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:34,022 INFO L87 Difference]: Start difference. First operand 12901 states and 40782 transitions. Second operand 3 states. [2019-12-27 03:37:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:34,180 INFO L93 Difference]: Finished difference Result 15817 states and 49346 transitions. [2019-12-27 03:37:34,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:34,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 03:37:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:34,215 INFO L225 Difference]: With dead ends: 15817 [2019-12-27 03:37:34,215 INFO L226 Difference]: Without dead ends: 15817 [2019-12-27 03:37:34,216 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-27 03:37:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15817 states. [2019-12-27 03:37:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15817 to 13996. [2019-12-27 03:37:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13996 states. [2019-12-27 03:37:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13996 states to 13996 states and 44106 transitions. [2019-12-27 03:37:34,581 INFO L78 Accepts]: Start accepts. Automaton has 13996 states and 44106 transitions. Word has length 25 [2019-12-27 03:37:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:34,582 INFO L462 AbstractCegarLoop]: Abstraction has 13996 states and 44106 transitions. [2019-12-27 03:37:34,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 13996 states and 44106 transitions. [2019-12-27 03:37:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:37:34,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:34,596 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-27 03:37:34,597 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-27 03:37:34,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:34,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366364177] [2019-12-27 03:37:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:34,674 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-27 03:37:34,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366364177] [2019-12-27 03:37:34,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:34,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:34,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921985682] [2019-12-27 03:37:34,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:34,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:34,676 INFO L87 Difference]: Start difference. First operand 13996 states and 44106 transitions. Second operand 4 states. [2019-12-27 03:37:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:34,708 INFO L93 Difference]: Finished difference Result 2296 states and 5225 transitions. [2019-12-27 03:37:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:37:34,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:37:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:34,711 INFO L225 Difference]: With dead ends: 2296 [2019-12-27 03:37:34,711 INFO L226 Difference]: Without dead ends: 2019 [2019-12-27 03:37:34,711 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-27 03:37:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-27 03:37:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-27 03:37:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 03:37:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4459 transitions. [2019-12-27 03:37:34,735 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4459 transitions. Word has length 25 [2019-12-27 03:37:34,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:34,735 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4459 transitions. [2019-12-27 03:37:34,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4459 transitions. [2019-12-27 03:37:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:37:34,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:34,738 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] [2019-12-27 03:37:34,738 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-27 03:37:34,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:34,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886441388] [2019-12-27 03:37:34,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:34,818 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-27 03:37:34,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886441388] [2019-12-27 03:37:34,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:34,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:37:34,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593997540] [2019-12-27 03:37:34,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:34,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:34,821 INFO L87 Difference]: Start difference. First operand 2019 states and 4459 transitions. Second operand 5 states. [2019-12-27 03:37:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:34,862 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-27 03:37:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:34,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:37:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:34,864 INFO L225 Difference]: With dead ends: 416 [2019-12-27 03:37:34,864 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 03:37:34,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 03:37:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-27 03:37:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 03:37:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-27 03:37:34,869 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-27 03:37:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:34,870 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-27 03:37:34,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-27 03:37:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:37:34,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:34,871 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] [2019-12-27 03:37:34,872 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:34,872 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-27 03:37:34,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:34,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239005508] [2019-12-27 03:37:34,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:35,005 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-27 03:37:35,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239005508] [2019-12-27 03:37:35,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:35,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:35,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242461472] [2019-12-27 03:37:35,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:35,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:35,008 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-27 03:37:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:35,026 INFO L93 Difference]: Finished difference Result 331 states and 582 transitions. [2019-12-27 03:37:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:35,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:37:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:35,028 INFO L225 Difference]: With dead ends: 331 [2019-12-27 03:37:35,028 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 03:37:35,028 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-27 03:37:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 03:37:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-27 03:37:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 03:37:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-27 03:37:35,032 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-27 03:37:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:35,032 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-27 03:37:35,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-27 03:37:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:37:35,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:35,033 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] [2019-12-27 03:37:35,034 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-27 03:37:35,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:35,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61636886] [2019-12-27 03:37:35,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:35,119 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-27 03:37:35,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61636886] [2019-12-27 03:37:35,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:35,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:37:35,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848286655] [2019-12-27 03:37:35,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:35,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:35,121 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-27 03:37:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:35,291 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-27 03:37:35,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:37:35,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 03:37:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:35,294 INFO L225 Difference]: With dead ends: 487 [2019-12-27 03:37:35,294 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 03:37:35,294 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-27 03:37:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 03:37:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-27 03:37:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 03:37:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-27 03:37:35,301 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-27 03:37:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:35,302 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-27 03:37:35,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-27 03:37:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:37:35,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:35,305 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] [2019-12-27 03:37:35,305 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-27 03:37:35,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:35,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201882630] [2019-12-27 03:37:35,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:35,483 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-27 03:37:35,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201882630] [2019-12-27 03:37:35,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:35,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:35,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382516259] [2019-12-27 03:37:35,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:35,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:35,487 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 3 states. [2019-12-27 03:37:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:35,544 INFO L93 Difference]: Finished difference Result 422 states and 747 transitions. [2019-12-27 03:37:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:35,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:37:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:35,546 INFO L225 Difference]: With dead ends: 422 [2019-12-27 03:37:35,546 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 03:37:35,547 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-27 03:37:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 03:37:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 331. [2019-12-27 03:37:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 03:37:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-27 03:37:35,554 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 53 [2019-12-27 03:37:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:35,556 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-27 03:37:35,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-27 03:37:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:35,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:35,558 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] [2019-12-27 03:37:35,558 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-27 03:37:35,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:35,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304986209] [2019-12-27 03:37:35,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:35,897 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-27 03:37:35,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304986209] [2019-12-27 03:37:35,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:35,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:37:35,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662773789] [2019-12-27 03:37:35,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:37:35,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:37:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:37:35,899 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 13 states. [2019-12-27 03:37:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:36,525 INFO L93 Difference]: Finished difference Result 815 states and 1389 transitions. [2019-12-27 03:37:36,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:37:36,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 03:37:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:36,526 INFO L225 Difference]: With dead ends: 815 [2019-12-27 03:37:36,526 INFO L226 Difference]: Without dead ends: 272 [2019-12-27 03:37:36,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:37:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-27 03:37:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 221. [2019-12-27 03:37:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 03:37:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 391 transitions. [2019-12-27 03:37:36,531 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 391 transitions. Word has length 54 [2019-12-27 03:37:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:36,531 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 391 transitions. [2019-12-27 03:37:36,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:37:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 391 transitions. [2019-12-27 03:37:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:36,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:36,532 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] [2019-12-27 03:37:36,532 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-27 03:37:36,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:36,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149752503] [2019-12-27 03:37:36,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:36,848 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-27 03:37:36,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149752503] [2019-12-27 03:37:36,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:36,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:37:36,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016534556] [2019-12-27 03:37:36,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:37:36,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:36,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:37:36,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:37:36,850 INFO L87 Difference]: Start difference. First operand 221 states and 391 transitions. Second operand 13 states. [2019-12-27 03:37:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:37,365 INFO L93 Difference]: Finished difference Result 388 states and 665 transitions. [2019-12-27 03:37:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:37:37,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 03:37:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:37,366 INFO L225 Difference]: With dead ends: 388 [2019-12-27 03:37:37,367 INFO L226 Difference]: Without dead ends: 355 [2019-12-27 03:37:37,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:37:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-27 03:37:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 321. [2019-12-27 03:37:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 03:37:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 562 transitions. [2019-12-27 03:37:37,373 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 562 transitions. Word has length 54 [2019-12-27 03:37:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:37,373 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 562 transitions. [2019-12-27 03:37:37,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:37:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 562 transitions. [2019-12-27 03:37:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:37,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:37,374 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] [2019-12-27 03:37:37,374 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:37,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-27 03:37:37,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:37,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372312661] [2019-12-27 03:37:37,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:38,037 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-27 03:37:38,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372312661] [2019-12-27 03:37:38,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:38,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 03:37:38,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327552688] [2019-12-27 03:37:38,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 03:37:38,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 03:37:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:37:38,040 INFO L87 Difference]: Start difference. First operand 321 states and 562 transitions. Second operand 18 states. [2019-12-27 03:37:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:39,152 INFO L93 Difference]: Finished difference Result 599 states and 1026 transitions. [2019-12-27 03:37:39,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:37:39,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-27 03:37:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:39,154 INFO L225 Difference]: With dead ends: 599 [2019-12-27 03:37:39,154 INFO L226 Difference]: Without dead ends: 566 [2019-12-27 03:37:39,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2019-12-27 03:37:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-12-27 03:37:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 343. [2019-12-27 03:37:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 03:37:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 604 transitions. [2019-12-27 03:37:39,160 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 604 transitions. Word has length 54 [2019-12-27 03:37:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:39,160 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 604 transitions. [2019-12-27 03:37:39,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 03:37:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 604 transitions. [2019-12-27 03:37:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:39,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:39,161 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] [2019-12-27 03:37:39,161 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash -778167690, now seen corresponding path program 4 times [2019-12-27 03:37:39,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:39,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314376533] [2019-12-27 03:37:39,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:39,416 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-27 03:37:39,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314376533] [2019-12-27 03:37:39,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:39,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:37:39,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247939502] [2019-12-27 03:37:39,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:37:39,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:37:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:37:39,419 INFO L87 Difference]: Start difference. First operand 343 states and 604 transitions. Second operand 12 states. [2019-12-27 03:37:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:39,699 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-27 03:37:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:37:39,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 03:37:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:39,700 INFO L225 Difference]: With dead ends: 446 [2019-12-27 03:37:39,700 INFO L226 Difference]: Without dead ends: 413 [2019-12-27 03:37:39,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:37:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-12-27 03:37:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 329. [2019-12-27 03:37:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 03:37:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 576 transitions. [2019-12-27 03:37:39,706 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 576 transitions. Word has length 54 [2019-12-27 03:37:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:39,706 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 576 transitions. [2019-12-27 03:37:39,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:37:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 576 transitions. [2019-12-27 03:37:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:39,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:39,708 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] [2019-12-27 03:37:39,708 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 5 times [2019-12-27 03:37:39,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:39,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573890384] [2019-12-27 03:37:39,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:37:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:37:39,897 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:37:39,899 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:37:39,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2009~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2009~0.base_24|) |v_ULTIMATE.start_main_~#t2009~0.offset_19| 0))) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2009~0.base_24|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24|)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= 0 |v_ULTIMATE.start_main_~#t2009~0.offset_19|) (= |v_#NULL.offset_3| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2009~0.base_24| 4)) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, ULTIMATE.start_main_~#t2009~0.offset=|v_ULTIMATE.start_main_~#t2009~0.offset_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_19|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_~#t2009~0.base=|v_ULTIMATE.start_main_~#t2009~0.base_24|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2009~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2009~0.base, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2010~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:37:39,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (= |v_ULTIMATE.start_main_~#t2010~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2010~0.base_11| 0)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|) |v_ULTIMATE.start_main_~#t2010~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2010~0.base_11| 4) |v_#length_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_~#t2010~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 03:37:39,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:37:39,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1528672807 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1528672807 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1528672807| ~y~0_In1528672807)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1528672807| ~y$w_buff1~0_In1528672807) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1528672807, ~y$w_buff1~0=~y$w_buff1~0_In1528672807, ~y~0=~y~0_In1528672807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528672807} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1528672807, ~y$w_buff1~0=~y$w_buff1~0_In1528672807, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1528672807|, ~y~0=~y~0_In1528672807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528672807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 03:37:39,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 03:37:39,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1142069188 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1142069188 256) 0))) (or (and (= ~y$w_buff0_used~0_In1142069188 |P1Thread1of1ForFork1_#t~ite11_Out1142069188|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1142069188| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1142069188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1142069188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1142069188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1142069188, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1142069188|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:37:39,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1651835569 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1651835569 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1651835569 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1651835569 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1651835569|)) (and (= ~y$w_buff1_used~0_In-1651835569 |P1Thread1of1ForFork1_#t~ite12_Out-1651835569|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1651835569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1651835569, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1651835569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1651835569} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1651835569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1651835569, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1651835569, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1651835569|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1651835569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:37:39,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1043965537 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1043965537 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1043965537|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-1043965537 |P1Thread1of1ForFork1_#t~ite13_Out-1043965537|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043965537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1043965537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043965537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1043965537, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1043965537|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:37:39,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1826320834 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1826320834 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1826320834 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1826320834 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1826320834 |P1Thread1of1ForFork1_#t~ite14_Out-1826320834|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1826320834| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1826320834, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1826320834, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1826320834, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1826320834} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1826320834, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1826320834, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1826320834, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1826320834|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1826320834} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:37:39,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:37:39,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In809925178 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In809925178 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out809925178| ~y$w_buff0_used~0_In809925178) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out809925178| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In809925178, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In809925178} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out809925178|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In809925178, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In809925178} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:37:39,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1400457863 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1400457863 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1400457863 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1400457863 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1400457863| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1400457863| ~y$w_buff1_used~0_In-1400457863) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1400457863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400457863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1400457863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400457863} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1400457863|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1400457863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400457863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1400457863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400457863} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:37:39,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1484138068 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1484138068 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-1484138068 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1484138068 ~y$r_buff0_thd1~0_Out-1484138068)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1484138068, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1484138068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1484138068, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1484138068|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1484138068} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:37:39,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-632590760 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-632590760 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-632590760 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-632590760 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-632590760|)) (and (= ~y$r_buff1_thd1~0_In-632590760 |P0Thread1of1ForFork0_#t~ite8_Out-632590760|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-632590760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-632590760, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-632590760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-632590760} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-632590760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-632590760, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-632590760|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-632590760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-632590760} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:37:39,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:37:39,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:37:39,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In2061580060 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2061580060 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite17_Out2061580060| |ULTIMATE.start_main_#t~ite18_Out2061580060|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out2061580060| ~y$w_buff1~0_In2061580060) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite17_Out2061580060| ~y~0_In2061580060) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2061580060, ~y~0=~y~0_In2061580060, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2061580060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2061580060} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out2061580060|, ~y$w_buff1~0=~y$w_buff1~0_In2061580060, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2061580060|, ~y~0=~y~0_In2061580060, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2061580060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2061580060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 03:37:39,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1897821502 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1897821502 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1897821502 |ULTIMATE.start_main_#t~ite19_Out1897821502|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1897821502| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1897821502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1897821502} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1897821502, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1897821502|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1897821502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 03:37:39,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In943538043 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In943538043 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In943538043 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In943538043 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out943538043| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out943538043| ~y$w_buff1_used~0_In943538043) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In943538043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In943538043, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In943538043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943538043} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In943538043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In943538043, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out943538043|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In943538043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943538043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:37:39,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1540718785 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1540718785 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1540718785| ~y$r_buff0_thd0~0_In1540718785) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1540718785| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1540718785, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1540718785} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1540718785, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1540718785, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1540718785|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:37:39,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1988598242 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1988598242 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1988598242 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1988598242 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1988598242| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out1988598242| ~y$r_buff1_thd0~0_In1988598242) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1988598242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1988598242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1988598242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1988598242} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1988598242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1988598242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1988598242, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1988598242|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1988598242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:37:39,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1809778295 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1809778295 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-1809778295 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1809778295 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1809778295 256))))) (= |ULTIMATE.start_main_#t~ite32_Out-1809778295| |ULTIMATE.start_main_#t~ite31_Out-1809778295|) .cse1 (= ~y$w_buff1~0_In-1809778295 |ULTIMATE.start_main_#t~ite31_Out-1809778295|)) (and (not .cse1) (= ~y$w_buff1~0_In-1809778295 |ULTIMATE.start_main_#t~ite32_Out-1809778295|) (= |ULTIMATE.start_main_#t~ite31_In-1809778295| |ULTIMATE.start_main_#t~ite31_Out-1809778295|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1809778295, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809778295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1809778295, ~weak$$choice2~0=~weak$$choice2~0_In-1809778295, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1809778295|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1809778295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1809778295} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1809778295, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809778295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1809778295, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1809778295|, ~weak$$choice2~0=~weak$$choice2~0_In-1809778295, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1809778295|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1809778295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1809778295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 03:37:39,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 03:37:39,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:37:39,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:37:40,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:37:40 BasicIcfg [2019-12-27 03:37:40,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:37:40,009 INFO L168 Benchmark]: Toolchain (without parser) took 21915.31 ms. Allocated memory was 144.2 MB in the beginning and 829.4 MB in the end (delta: 685.2 MB). Free memory was 100.9 MB in the beginning and 410.2 MB in the end (delta: -309.3 MB). Peak memory consumption was 376.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,010 INFO L168 Benchmark]: CDTParser took 0.23 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: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.31 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.81 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,012 INFO L168 Benchmark]: Boogie Preprocessor took 60.19 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,012 INFO L168 Benchmark]: RCFGBuilder took 777.36 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.2 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,013 INFO L168 Benchmark]: TraceAbstraction took 20237.18 ms. Allocated memory was 202.4 MB in the beginning and 829.4 MB in the end (delta: 627.0 MB). Free memory was 107.2 MB in the beginning and 410.2 MB in the end (delta: -303.0 MB). Peak memory consumption was 324.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:40,017 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.23 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: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.31 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.81 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.19 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.36 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.2 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20237.18 ms. Allocated memory was 202.4 MB in the beginning and 829.4 MB in the end (delta: 627.0 MB). Free memory was 107.2 MB in the beginning and 410.2 MB in the end (delta: -303.0 MB). Peak memory consumption was 324.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1601 SDtfs, 1995 SDslu, 4646 SDs, 0 SdLazy, 3319 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13996occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 15330 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 151024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...