/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:18:46,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:18:46,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:18:46,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:18:46,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:18:46,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:18:46,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:18:46,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:18:46,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:18:46,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:18:46,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:18:46,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:18:46,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:18:46,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:18:46,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:18:46,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:18:46,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:18:46,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:18:46,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:18:46,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:18:46,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:18:46,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:18:46,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:18:46,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:18:46,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:18:46,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:18:46,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:18:46,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:18:46,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:18:46,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:18:46,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:18:46,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:18:46,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:18:46,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:18:46,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:18:46,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:18:46,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:18:46,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:18:46,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:18:46,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:18:46,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:18:46,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:18:46,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:18:46,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:18:46,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:18:46,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:18:46,879 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:18:46,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:18:46,882 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:18:46,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:18:46,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:18:46,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:18:46,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:18:46,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:18:46,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:18:46,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:18:46,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:18:46,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:18:46,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:18:46,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:18:46,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:18:46,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:18:46,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:18:46,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:18:46,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:18:46,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:18:46,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:18:46,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:18:46,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:18:46,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:18:46,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:18:46,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:18:47,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:18:47,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:18:47,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:18:47,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:18:47,186 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:18:47,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-26 23:18:47,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9ddbb3b/481eb18a9ee74e84bc9b2a8fe69cb11d/FLAGbc831dfb3 [2019-12-26 23:18:47,793 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:18:47,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-26 23:18:47,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9ddbb3b/481eb18a9ee74e84bc9b2a8fe69cb11d/FLAGbc831dfb3 [2019-12-26 23:18:48,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9ddbb3b/481eb18a9ee74e84bc9b2a8fe69cb11d [2019-12-26 23:18:48,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:18:48,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:18:48,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:18:48,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:18:48,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:18:48,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1562cfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48, skipping insertion in model container [2019-12-26 23:18:48,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:18:48,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:18:48,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:18:48,735 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:18:48,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:18:48,888 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:18:48,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48 WrapperNode [2019-12-26 23:18:48,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:18:48,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:18:48,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:18:48,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:18:48,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:18:48,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:18:48,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:18:48,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:18:48,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... [2019-12-26 23:18:48,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:18:48,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:18:48,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:18:48,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:18:48,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:18:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:18:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:18:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:18:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:18:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:18:49,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:18:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:18:49,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:18:49,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:18:49,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:18:49,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:18:49,074 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:18:49,771 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:18:49,771 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:18:49,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:18:49 BoogieIcfgContainer [2019-12-26 23:18:49,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:18:49,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:18:49,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:18:49,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:18:49,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:18:48" (1/3) ... [2019-12-26 23:18:49,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148ee0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:18:49, skipping insertion in model container [2019-12-26 23:18:49,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:48" (2/3) ... [2019-12-26 23:18:49,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148ee0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:18:49, skipping insertion in model container [2019-12-26 23:18:49,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:18:49" (3/3) ... [2019-12-26 23:18:49,783 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-26 23:18:49,795 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:18:49,795 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:18:49,806 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:18:49,807 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:18:49,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,873 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:49,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:18:49,979 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:18:49,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:18:49,980 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:18:49,980 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:18:49,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:18:49,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:18:49,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:18:49,981 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:18:50,005 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:18:50,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:18:50,114 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:18:50,114 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:18:50,132 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:18:50,150 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:18:50,216 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:18:50,216 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:18:50,222 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:18:50,236 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:18:50,237 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:18:54,888 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:18:54,998 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:18:55,392 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-26 23:18:55,393 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-26 23:18:55,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-26 23:18:55,971 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-26 23:18:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-26 23:18:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:18:55,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:55,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:18:55,982 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-26 23:18:56,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:56,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037556559] [2019-12-26 23:18:56,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:56,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037556559] [2019-12-26 23:18:56,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:56,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:18:56,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257629643] [2019-12-26 23:18:56,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:56,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:56,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:56,238 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-26 23:18:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:56,739 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-26 23:18:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:56,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:18:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:56,854 INFO L225 Difference]: With dead ends: 9266 [2019-12-26 23:18:56,854 INFO L226 Difference]: Without dead ends: 8258 [2019-12-26 23:18:56,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-26 23:18:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-26 23:18:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-26 23:18:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-26 23:18:57,305 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-26 23:18:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:57,305 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-26 23:18:57,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-26 23:18:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:18:57,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:57,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:57,310 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-26 23:18:57,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:57,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969186747] [2019-12-26 23:18:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:57,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969186747] [2019-12-26 23:18:57,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:57,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:18:57,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12513235] [2019-12-26 23:18:57,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:57,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:57,467 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-26 23:18:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:57,526 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-26 23:18:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:18:57,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:18:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:57,535 INFO L225 Difference]: With dead ends: 1877 [2019-12-26 23:18:57,535 INFO L226 Difference]: Without dead ends: 1373 [2019-12-26 23:18:57,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-26 23:18:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-26 23:18:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-26 23:18:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-26 23:18:57,573 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-26 23:18:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:57,574 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-26 23:18:57,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-26 23:18:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:18:57,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:57,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:57,576 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-26 23:18:57,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:57,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922249684] [2019-12-26 23:18:57,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:57,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922249684] [2019-12-26 23:18:57,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244895088] [2019-12-26 23:18:57,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:57,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:57,710 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-26 23:18:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:57,940 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-26 23:18:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:18:57,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:18:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:57,950 INFO L225 Difference]: With dead ends: 1700 [2019-12-26 23:18:57,950 INFO L226 Difference]: Without dead ends: 1700 [2019-12-26 23:18:57,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-26 23:18:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-26 23:18:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-26 23:18:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-26 23:18:58,052 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-26 23:18:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:58,054 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-26 23:18:58,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-26 23:18:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:18:58,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:58,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:58,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-26 23:18:58,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:58,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738485179] [2019-12-26 23:18:58,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:58,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738485179] [2019-12-26 23:18:58,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:58,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:58,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812183658] [2019-12-26 23:18:58,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:18:58,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:58,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:18:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:58,208 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-12-26 23:18:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:58,879 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-12-26 23:18:58,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:18:58,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:18:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:58,928 INFO L225 Difference]: With dead ends: 4529 [2019-12-26 23:18:58,930 INFO L226 Difference]: Without dead ends: 4494 [2019-12-26 23:18:58,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:18:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-12-26 23:18:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-12-26 23:18:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-12-26 23:18:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-12-26 23:18:59,007 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-12-26 23:18:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:59,007 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-12-26 23:18:59,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:18:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-12-26 23:18:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:18:59,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:59,011 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] [2019-12-26 23:18:59,011 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:59,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-26 23:18:59,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:59,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829434511] [2019-12-26 23:18:59,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:59,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829434511] [2019-12-26 23:18:59,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:59,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:18:59,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596877426] [2019-12-26 23:18:59,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:59,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:59,111 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 3 states. [2019-12-26 23:18:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:59,128 INFO L93 Difference]: Finished difference Result 2195 states and 4961 transitions. [2019-12-26 23:18:59,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:59,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 23:18:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:59,135 INFO L225 Difference]: With dead ends: 2195 [2019-12-26 23:18:59,135 INFO L226 Difference]: Without dead ends: 2195 [2019-12-26 23:18:59,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-26 23:18:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2195. [2019-12-26 23:18:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-26 23:18:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-26 23:18:59,187 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 26 [2019-12-26 23:18:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:59,188 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-26 23:18:59,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-26 23:18:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:18:59,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:59,191 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] [2019-12-26 23:18:59,192 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-26 23:18:59,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:59,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580794252] [2019-12-26 23:18:59,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:59,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580794252] [2019-12-26 23:18:59,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:59,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:59,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178389514] [2019-12-26 23:18:59,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:18:59,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:18:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:59,356 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-26 23:19:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:00,068 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-26 23:19:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:19:00,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-26 23:19:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:00,079 INFO L225 Difference]: With dead ends: 4412 [2019-12-26 23:19:00,079 INFO L226 Difference]: Without dead ends: 4383 [2019-12-26 23:19:00,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:19:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-26 23:19:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-26 23:19:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-26 23:19:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-26 23:19:00,142 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-26 23:19:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-26 23:19:00,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:19:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-26 23:19:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:19:00,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:00,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:00,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-26 23:19:00,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:00,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899380645] [2019-12-26 23:19:00,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:00,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899380645] [2019-12-26 23:19:00,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:00,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:19:00,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668768761] [2019-12-26 23:19:00,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:00,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:00,242 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-26 23:19:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:00,697 INFO L93 Difference]: Finished difference Result 3102 states and 6886 transitions. [2019-12-26 23:19:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:19:00,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:19:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:00,704 INFO L225 Difference]: With dead ends: 3102 [2019-12-26 23:19:00,704 INFO L226 Difference]: Without dead ends: 3102 [2019-12-26 23:19:00,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:19:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-12-26 23:19:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2654. [2019-12-26 23:19:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-26 23:19:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 5970 transitions. [2019-12-26 23:19:00,760 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 5970 transitions. Word has length 27 [2019-12-26 23:19:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:00,761 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 5970 transitions. [2019-12-26 23:19:00,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 5970 transitions. [2019-12-26 23:19:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:19:00,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:00,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:00,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-26 23:19:00,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:00,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235853763] [2019-12-26 23:19:00,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:00,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235853763] [2019-12-26 23:19:00,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:00,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:19:00,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441272748] [2019-12-26 23:19:00,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:00,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:00,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:00,844 INFO L87 Difference]: Start difference. First operand 2654 states and 5970 transitions. Second operand 5 states. [2019-12-26 23:19:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:00,893 INFO L93 Difference]: Finished difference Result 1623 states and 3504 transitions. [2019-12-26 23:19:00,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:19:00,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:19:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:00,897 INFO L225 Difference]: With dead ends: 1623 [2019-12-26 23:19:00,897 INFO L226 Difference]: Without dead ends: 1475 [2019-12-26 23:19:00,898 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-26 23:19:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-26 23:19:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1374. [2019-12-26 23:19:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-26 23:19:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2999 transitions. [2019-12-26 23:19:00,928 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2999 transitions. Word has length 28 [2019-12-26 23:19:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:00,928 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2999 transitions. [2019-12-26 23:19:00,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2999 transitions. [2019-12-26 23:19:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:19:00,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:00,933 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] [2019-12-26 23:19:00,933 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-26 23:19:00,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:00,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125418750] [2019-12-26 23:19:00,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:01,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125418750] [2019-12-26 23:19:01,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:01,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:19:01,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101934755] [2019-12-26 23:19:01,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:19:01,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:19:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:19:01,098 INFO L87 Difference]: Start difference. First operand 1374 states and 2999 transitions. Second operand 7 states. [2019-12-26 23:19:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:01,369 INFO L93 Difference]: Finished difference Result 4064 states and 8639 transitions. [2019-12-26 23:19:01,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:19:01,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:19:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:01,376 INFO L225 Difference]: With dead ends: 4064 [2019-12-26 23:19:01,376 INFO L226 Difference]: Without dead ends: 2676 [2019-12-26 23:19:01,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:19:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-26 23:19:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1440. [2019-12-26 23:19:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-26 23:19:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3133 transitions. [2019-12-26 23:19:01,414 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3133 transitions. Word has length 51 [2019-12-26 23:19:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:01,414 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3133 transitions. [2019-12-26 23:19:01,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:19:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3133 transitions. [2019-12-26 23:19:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:19:01,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:01,418 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] [2019-12-26 23:19:01,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-26 23:19:01,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:01,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128055564] [2019-12-26 23:19:01,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:01,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128055564] [2019-12-26 23:19:01,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:01,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:19:01,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145084625] [2019-12-26 23:19:01,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:19:01,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:01,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:19:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:19:01,580 INFO L87 Difference]: Start difference. First operand 1440 states and 3133 transitions. Second operand 7 states. [2019-12-26 23:19:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:02,824 INFO L93 Difference]: Finished difference Result 3010 states and 6346 transitions. [2019-12-26 23:19:02,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:19:02,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:19:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:02,833 INFO L225 Difference]: With dead ends: 3010 [2019-12-26 23:19:02,833 INFO L226 Difference]: Without dead ends: 3010 [2019-12-26 23:19:02,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:19:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2019-12-26 23:19:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1524. [2019-12-26 23:19:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-12-26 23:19:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 3330 transitions. [2019-12-26 23:19:02,935 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 3330 transitions. Word has length 51 [2019-12-26 23:19:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:02,937 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 3330 transitions. [2019-12-26 23:19:02,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:19:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 3330 transitions. [2019-12-26 23:19:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:19:02,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:02,941 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] [2019-12-26 23:19:02,941 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1191050856, now seen corresponding path program 3 times [2019-12-26 23:19:02,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:02,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695036468] [2019-12-26 23:19:02,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:03,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695036468] [2019-12-26 23:19:03,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:03,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:19:03,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871269638] [2019-12-26 23:19:03,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:03,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:03,045 INFO L87 Difference]: Start difference. First operand 1524 states and 3330 transitions. Second operand 3 states. [2019-12-26 23:19:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:03,106 INFO L93 Difference]: Finished difference Result 1933 states and 4174 transitions. [2019-12-26 23:19:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:03,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:19:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:03,115 INFO L225 Difference]: With dead ends: 1933 [2019-12-26 23:19:03,115 INFO L226 Difference]: Without dead ends: 1933 [2019-12-26 23:19:03,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-26 23:19:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1530. [2019-12-26 23:19:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2019-12-26 23:19:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3346 transitions. [2019-12-26 23:19:03,143 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3346 transitions. Word has length 51 [2019-12-26 23:19:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:03,143 INFO L462 AbstractCegarLoop]: Abstraction has 1530 states and 3346 transitions. [2019-12-26 23:19:03,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3346 transitions. [2019-12-26 23:19:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:19:03,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:03,148 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-26 23:19:03,148 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-26 23:19:03,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:03,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712750881] [2019-12-26 23:19:03,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:03,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712750881] [2019-12-26 23:19:03,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:03,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:19:03,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645341073] [2019-12-26 23:19:03,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:19:03,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:19:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:19:03,292 INFO L87 Difference]: Start difference. First operand 1530 states and 3346 transitions. Second operand 8 states. [2019-12-26 23:19:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:04,850 INFO L93 Difference]: Finished difference Result 3083 states and 6499 transitions. [2019-12-26 23:19:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:19:04,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-26 23:19:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:04,857 INFO L225 Difference]: With dead ends: 3083 [2019-12-26 23:19:04,857 INFO L226 Difference]: Without dead ends: 3083 [2019-12-26 23:19:04,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:19:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-12-26 23:19:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 1557. [2019-12-26 23:19:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-12-26 23:19:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3381 transitions. [2019-12-26 23:19:04,902 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3381 transitions. Word has length 52 [2019-12-26 23:19:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:04,903 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 3381 transitions. [2019-12-26 23:19:04,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:19:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3381 transitions. [2019-12-26 23:19:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:19:04,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:04,907 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-26 23:19:04,907 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash -709931818, now seen corresponding path program 1 times [2019-12-26 23:19:04,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:04,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526285024] [2019-12-26 23:19:04,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:05,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526285024] [2019-12-26 23:19:05,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:05,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:19:05,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301197378] [2019-12-26 23:19:05,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:19:05,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:05,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:19:05,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:19:05,130 INFO L87 Difference]: Start difference. First operand 1557 states and 3381 transitions. Second operand 7 states. [2019-12-26 23:19:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:06,234 INFO L93 Difference]: Finished difference Result 2962 states and 6177 transitions. [2019-12-26 23:19:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:19:06,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 23:19:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:06,239 INFO L225 Difference]: With dead ends: 2962 [2019-12-26 23:19:06,240 INFO L226 Difference]: Without dead ends: 2962 [2019-12-26 23:19:06,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:19:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-12-26 23:19:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1592. [2019-12-26 23:19:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-12-26 23:19:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3462 transitions. [2019-12-26 23:19:06,275 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3462 transitions. Word has length 52 [2019-12-26 23:19:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:06,276 INFO L462 AbstractCegarLoop]: Abstraction has 1592 states and 3462 transitions. [2019-12-26 23:19:06,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:19:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3462 transitions. [2019-12-26 23:19:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:19:06,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:06,280 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-26 23:19:06,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1725495463, now seen corresponding path program 2 times [2019-12-26 23:19:06,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:06,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482656038] [2019-12-26 23:19:06,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:06,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482656038] [2019-12-26 23:19:06,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:06,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:19:06,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786109927] [2019-12-26 23:19:06,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:06,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:06,342 INFO L87 Difference]: Start difference. First operand 1592 states and 3462 transitions. Second operand 3 states. [2019-12-26 23:19:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:06,356 INFO L93 Difference]: Finished difference Result 1591 states and 3460 transitions. [2019-12-26 23:19:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:06,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:19:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:06,359 INFO L225 Difference]: With dead ends: 1591 [2019-12-26 23:19:06,359 INFO L226 Difference]: Without dead ends: 1591 [2019-12-26 23:19:06,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-26 23:19:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1125. [2019-12-26 23:19:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-12-26 23:19:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2488 transitions. [2019-12-26 23:19:06,381 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2488 transitions. Word has length 52 [2019-12-26 23:19:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:06,381 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 2488 transitions. [2019-12-26 23:19:06,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2488 transitions. [2019-12-26 23:19:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:19:06,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:06,384 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-26 23:19:06,385 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:06,385 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-26 23:19:06,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:06,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440480190] [2019-12-26 23:19:06,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:19:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:19:06,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:19:06,537 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:19:06,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:19:06,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:19:06,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-26 23:19:06,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-664238535 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-664238535 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-664238535| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-664238535 |P0Thread1of1ForFork0_#t~ite5_Out-664238535|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-664238535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-664238535} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-664238535|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-664238535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-664238535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:19:06,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1551602419 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1551602419| |P1Thread1of1ForFork1_#t~ite14_Out1551602419|) (= |P1Thread1of1ForFork1_#t~ite15_Out1551602419| ~x$w_buff0~0_In1551602419)) (and .cse0 (= ~x$w_buff0~0_In1551602419 |P1Thread1of1ForFork1_#t~ite14_Out1551602419|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1551602419 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1551602419 256))) (= (mod ~x$w_buff0_used~0_In1551602419 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In1551602419 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite15_Out1551602419| |P1Thread1of1ForFork1_#t~ite14_Out1551602419|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1551602419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1551602419, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1551602419, ~weak$$choice2~0=~weak$$choice2~0_In1551602419, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1551602419, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1551602419|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1551602419} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1551602419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1551602419, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1551602419, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1551602419|, ~weak$$choice2~0=~weak$$choice2~0_In1551602419, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1551602419, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1551602419|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1551602419} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:19:06,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-208869789 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-208869789 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-208869789 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-208869789 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-208869789|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-208869789 |P0Thread1of1ForFork0_#t~ite6_Out-208869789|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-208869789, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-208869789, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-208869789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-208869789} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-208869789|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-208869789, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-208869789, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-208869789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-208869789} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:19:06,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-42726521 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-42726521 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd1~0_Out-42726521 0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_Out-42726521 ~x$r_buff0_thd1~0_In-42726521) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-42726521, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-42726521} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-42726521, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-42726521|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-42726521} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:19:06,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-966444391 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-966444391 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-966444391 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-966444391 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-966444391| ~x$r_buff1_thd1~0_In-966444391) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-966444391|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-966444391, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966444391, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-966444391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966444391} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-966444391, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-966444391|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966444391, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-966444391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966444391} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:19:06,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:19:06,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1855555876 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-1855555876| |P1Thread1of1ForFork1_#t~ite17_Out-1855555876|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1855555876 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1855555876 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1855555876 256))) (= (mod ~x$w_buff0_used~0_In-1855555876 256) 0))) (= ~x$w_buff1~0_In-1855555876 |P1Thread1of1ForFork1_#t~ite17_Out-1855555876|)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1855555876| ~x$w_buff1~0_In-1855555876) (= |P1Thread1of1ForFork1_#t~ite17_In-1855555876| |P1Thread1of1ForFork1_#t~ite17_Out-1855555876|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1855555876, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1855555876, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1855555876, ~weak$$choice2~0=~weak$$choice2~0_In-1855555876, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1855555876, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1855555876|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1855555876} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1855555876|, ~x$w_buff1~0=~x$w_buff1~0_In-1855555876, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1855555876, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1855555876, ~weak$$choice2~0=~weak$$choice2~0_In-1855555876, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1855555876, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1855555876|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1855555876} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:19:06,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In810385673 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out810385673| ~x$w_buff0_used~0_In810385673) (= |P1Thread1of1ForFork1_#t~ite20_In810385673| |P1Thread1of1ForFork1_#t~ite20_Out810385673|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out810385673| ~x$w_buff0_used~0_In810385673) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In810385673 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In810385673 256)) (and (= (mod ~x$r_buff1_thd2~0_In810385673 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In810385673 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out810385673| |P1Thread1of1ForFork1_#t~ite20_Out810385673|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In810385673|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In810385673, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In810385673, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In810385673, ~weak$$choice2~0=~weak$$choice2~0_In810385673, ~x$w_buff0_used~0=~x$w_buff0_used~0_In810385673} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out810385673|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In810385673, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In810385673, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out810385673|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In810385673, ~weak$$choice2~0=~weak$$choice2~0_In810385673, ~x$w_buff0_used~0=~x$w_buff0_used~0_In810385673} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:19:06,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:19:06,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1475236818 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out1475236818| ~x$r_buff1_thd2~0_In1475236818) (= |P1Thread1of1ForFork1_#t~ite29_In1475236818| |P1Thread1of1ForFork1_#t~ite29_Out1475236818|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out1475236818| |P1Thread1of1ForFork1_#t~ite29_Out1475236818|) (= |P1Thread1of1ForFork1_#t~ite29_Out1475236818| ~x$r_buff1_thd2~0_In1475236818) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1475236818 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1475236818 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1475236818 256)) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In1475236818 256) 0))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1475236818|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1475236818, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1475236818, ~weak$$choice2~0=~weak$$choice2~0_In1475236818, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1475236818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1475236818} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1475236818|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1475236818|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1475236818, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1475236818, ~weak$$choice2~0=~weak$$choice2~0_In1475236818, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1475236818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1475236818} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:19:06,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-26 23:19:06,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1335433040 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1335433040 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1335433040 |P1Thread1of1ForFork1_#t~ite32_Out1335433040|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In1335433040 |P1Thread1of1ForFork1_#t~ite32_Out1335433040|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1335433040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1335433040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1335433040, ~x~0=~x~0_In1335433040} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1335433040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1335433040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1335433040, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1335433040|, ~x~0=~x~0_In1335433040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:19:06,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:19:06,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In507389898 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In507389898 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out507389898| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out507389898| ~x$w_buff0_used~0_In507389898)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In507389898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507389898} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out507389898|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In507389898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507389898} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:19:06,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1246238600 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1246238600 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1246238600 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1246238600 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1246238600 |P1Thread1of1ForFork1_#t~ite35_Out1246238600|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1246238600|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1246238600, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1246238600, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1246238600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1246238600} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1246238600, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1246238600, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1246238600|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1246238600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1246238600} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:19:06,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In413002093 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In413002093 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out413002093| ~x$r_buff0_thd2~0_In413002093)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out413002093| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In413002093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In413002093} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In413002093, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out413002093|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In413002093} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:19:06,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1691688814 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1691688814 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1691688814 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1691688814 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1691688814 |P1Thread1of1ForFork1_#t~ite37_Out1691688814|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1691688814|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1691688814, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1691688814, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1691688814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1691688814} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1691688814, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1691688814, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1691688814, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1691688814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1691688814} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:19:06,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:19:06,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:19:06,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1235735896 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1235735896 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1235735896| ~x~0_In1235735896)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1235735896| ~x$w_buff1~0_In1235735896)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1235735896, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1235735896, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1235735896, ~x~0=~x~0_In1235735896} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1235735896|, ~x$w_buff1~0=~x$w_buff1~0_In1235735896, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1235735896, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1235735896, ~x~0=~x~0_In1235735896} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:19:06,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-26 23:19:06,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2140248033 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2140248033 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2140248033 |ULTIMATE.start_main_#t~ite42_Out-2140248033|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2140248033| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2140248033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2140248033} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2140248033, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2140248033|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2140248033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:19:06,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2128696350 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2128696350 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-2128696350 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2128696350 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-2128696350| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out-2128696350| ~x$w_buff1_used~0_In-2128696350) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2128696350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2128696350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2128696350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128696350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2128696350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2128696350, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2128696350|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2128696350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128696350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:19:06,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1594683094 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1594683094 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1594683094| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1594683094| ~x$r_buff0_thd0~0_In-1594683094) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1594683094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1594683094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1594683094, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1594683094|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1594683094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:19:06,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2041438838 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2041438838 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2041438838 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2041438838 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out2041438838|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out2041438838| ~x$r_buff1_thd0~0_In2041438838) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2041438838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2041438838, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2041438838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2041438838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2041438838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2041438838, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2041438838, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2041438838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2041438838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:19:06,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:19:06,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:19:06 BasicIcfg [2019-12-26 23:19:06,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:19:06,646 INFO L168 Benchmark]: Toolchain (without parser) took 18559.17 ms. Allocated memory was 147.3 MB in the beginning and 457.7 MB in the end (delta: 310.4 MB). Free memory was 103.5 MB in the beginning and 166.1 MB in the end (delta: -62.6 MB). Peak memory consumption was 247.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,647 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.47 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 103.3 MB in the beginning and 160.8 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 206.6 MB. Free memory was 160.8 MB in the beginning and 158.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,649 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 206.6 MB. Free memory was 158.2 MB in the beginning and 156.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,649 INFO L168 Benchmark]: RCFGBuilder took 783.58 ms. Allocated memory is still 206.6 MB. Free memory was 156.2 MB in the beginning and 111.7 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,650 INFO L168 Benchmark]: TraceAbstraction took 16870.05 ms. Allocated memory was 206.6 MB in the beginning and 457.7 MB in the end (delta: 251.1 MB). Free memory was 111.7 MB in the beginning and 166.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 196.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:06,654 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.48 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.47 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 103.3 MB in the beginning and 160.8 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 206.6 MB. Free memory was 160.8 MB in the beginning and 158.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 206.6 MB. Free memory was 158.2 MB in the beginning and 156.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.58 ms. Allocated memory is still 206.6 MB. Free memory was 156.2 MB in the beginning and 111.7 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16870.05 ms. Allocated memory was 206.6 MB in the beginning and 457.7 MB in the end (delta: 251.1 MB). Free memory was 111.7 MB in the beginning and 166.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 196.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2262 SDtfs, 2655 SDslu, 5339 SDs, 0 SdLazy, 4280 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 31 SyntacticMatches, 14 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 11711 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 68655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...