/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:07:33,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:07:33,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:07:33,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:07:33,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:07:33,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:07:33,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:07:33,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:07:33,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:07:33,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:07:33,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:07:33,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:07:33,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:07:33,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:07:33,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:07:33,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:07:33,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:07:33,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:07:33,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:07:33,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:07:33,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:07:33,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:07:33,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:07:33,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:07:33,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:07:33,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:07:33,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:07:33,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:07:33,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:07:33,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:07:33,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:07:33,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:07:33,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:07:33,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:07:33,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:07:33,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:07:33,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:07:33,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:07:33,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:07:33,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:07:33,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:07:33,818 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-18 13:07:33,833 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:07:33,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:07:33,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:07:33,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:07:33,835 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:07:33,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:07:33,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:07:33,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:07:33,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:07:33,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:07:33,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:07:33,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:07:33,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:07:33,838 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:07:33,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:07:33,838 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:07:33,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:07:33,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:07:33,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:07:33,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:07:33,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:07:33,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:07:33,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:07:33,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:07:33,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:07:33,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:07:33,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:07:33,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:07:33,842 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:07:33,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:07:34,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:07:34,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:07:34,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:07:34,155 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:07:34,156 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:07:34,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-18 13:07:34,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b90bff6f/6b448e7609c24e4f80f8f83dede9314f/FLAG6d3bf1058 [2019-12-18 13:07:34,828 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:07:34,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-18 13:07:34,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b90bff6f/6b448e7609c24e4f80f8f83dede9314f/FLAG6d3bf1058 [2019-12-18 13:07:35,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b90bff6f/6b448e7609c24e4f80f8f83dede9314f [2019-12-18 13:07:35,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:07:35,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:07:35,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:07:35,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:07:35,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:07:35,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:35,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6968dd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35, skipping insertion in model container [2019-12-18 13:07:35,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:35,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:07:35,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:07:35,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:07:35,775 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:07:35,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:07:35,959 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:07:35,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35 WrapperNode [2019-12-18 13:07:35,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:07:35,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:07:35,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:07:35,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:07:35,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:07:36,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:07:36,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:07:36,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:07:36,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (1/1) ... [2019-12-18 13:07:36,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:07:36,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:07:36,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:07:36,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:07:36,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (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-18 13:07:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:07:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:07:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:07:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:07:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:07:36,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:07:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:07:36,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:07:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:07:36,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:07:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:07:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:07:36,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:07:36,163 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:07:37,058 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:07:37,058 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:07:37,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:07:37 BoogieIcfgContainer [2019-12-18 13:07:37,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:07:37,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:07:37,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:07:37,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:07:37,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:07:35" (1/3) ... [2019-12-18 13:07:37,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686a8d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:07:37, skipping insertion in model container [2019-12-18 13:07:37,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:07:35" (2/3) ... [2019-12-18 13:07:37,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686a8d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:07:37, skipping insertion in model container [2019-12-18 13:07:37,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:07:37" (3/3) ... [2019-12-18 13:07:37,073 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2019-12-18 13:07:37,097 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:07:37,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:07:37,108 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:07:37,109 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:07:37,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,149 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,149 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,158 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,190 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,191 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,192 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:07:37,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:07:37,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:07:37,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:07:37,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:07:37,236 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:07:37,236 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:07:37,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:07:37,236 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:07:37,236 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:07:37,259 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-18 13:07:37,261 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 13:07:37,428 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 13:07:37,428 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:07:37,456 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 13:07:37,488 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 13:07:37,579 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 13:07:37,579 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:07:37,592 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 13:07:37,624 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-18 13:07:37,626 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:07:43,025 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 13:07:43,148 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 13:07:43,498 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:07:43,611 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:07:43,764 INFO L206 etLargeBlockEncoding]: Checked pairs total: 165402 [2019-12-18 13:07:43,765 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 13:07:43,773 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 143 transitions [2019-12-18 13:07:48,489 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 57466 states. [2019-12-18 13:07:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 57466 states. [2019-12-18 13:07:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:07:48,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:48,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:48,498 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash -953839885, now seen corresponding path program 1 times [2019-12-18 13:07:48,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:48,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64131006] [2019-12-18 13:07:48,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:48,874 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-18 13:07:48,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64131006] [2019-12-18 13:07:48,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:48,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:07:48,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766693178] [2019-12-18 13:07:48,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:48,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:48,901 INFO L87 Difference]: Start difference. First operand 57466 states. Second operand 3 states. [2019-12-18 13:07:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:49,780 INFO L93 Difference]: Finished difference Result 57370 states and 231250 transitions. [2019-12-18 13:07:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:49,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:07:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:51,724 INFO L225 Difference]: With dead ends: 57370 [2019-12-18 13:07:51,724 INFO L226 Difference]: Without dead ends: 56226 [2019-12-18 13:07:51,725 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-18 13:07:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56226 states. [2019-12-18 13:07:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56226 to 56226. [2019-12-18 13:07:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56226 states. [2019-12-18 13:07:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56226 states to 56226 states and 226882 transitions. [2019-12-18 13:07:54,846 INFO L78 Accepts]: Start accepts. Automaton has 56226 states and 226882 transitions. Word has length 7 [2019-12-18 13:07:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:54,847 INFO L462 AbstractCegarLoop]: Abstraction has 56226 states and 226882 transitions. [2019-12-18 13:07:54,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 56226 states and 226882 transitions. [2019-12-18 13:07:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:07:54,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:54,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:54,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash 749632042, now seen corresponding path program 1 times [2019-12-18 13:07:54,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:54,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486827850] [2019-12-18 13:07:54,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:55,000 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-18 13:07:55,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486827850] [2019-12-18 13:07:55,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:55,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:55,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259208869] [2019-12-18 13:07:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:55,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:55,003 INFO L87 Difference]: Start difference. First operand 56226 states and 226882 transitions. Second operand 4 states. [2019-12-18 13:07:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:58,117 INFO L93 Difference]: Finished difference Result 90514 states and 350820 transitions. [2019-12-18 13:07:58,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:58,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:07:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:58,813 INFO L225 Difference]: With dead ends: 90514 [2019-12-18 13:07:58,814 INFO L226 Difference]: Without dead ends: 90500 [2019-12-18 13:07:58,815 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-18 13:08:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90500 states. [2019-12-18 13:08:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90500 to 87886. [2019-12-18 13:08:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87886 states. [2019-12-18 13:08:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87886 states to 87886 states and 342542 transitions. [2019-12-18 13:08:03,547 INFO L78 Accepts]: Start accepts. Automaton has 87886 states and 342542 transitions. Word has length 13 [2019-12-18 13:08:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:03,547 INFO L462 AbstractCegarLoop]: Abstraction has 87886 states and 342542 transitions. [2019-12-18 13:08:03,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:08:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87886 states and 342542 transitions. [2019-12-18 13:08:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:08:03,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:03,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:03,551 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1969493490, now seen corresponding path program 1 times [2019-12-18 13:08:03,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:03,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071585462] [2019-12-18 13:08:03,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:03,630 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-18 13:08:03,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071585462] [2019-12-18 13:08:03,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:03,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:03,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259480628] [2019-12-18 13:08:03,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:03,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:03,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:03,632 INFO L87 Difference]: Start difference. First operand 87886 states and 342542 transitions. Second operand 3 states. [2019-12-18 13:08:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:03,812 INFO L93 Difference]: Finished difference Result 48011 states and 163167 transitions. [2019-12-18 13:08:03,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:03,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:08:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:03,902 INFO L225 Difference]: With dead ends: 48011 [2019-12-18 13:08:03,903 INFO L226 Difference]: Without dead ends: 48011 [2019-12-18 13:08:03,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48011 states. [2019-12-18 13:08:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48011 to 48011. [2019-12-18 13:08:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-12-18 13:08:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 163167 transitions. [2019-12-18 13:08:07,982 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 163167 transitions. Word has length 13 [2019-12-18 13:08:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:07,982 INFO L462 AbstractCegarLoop]: Abstraction has 48011 states and 163167 transitions. [2019-12-18 13:08:07,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 163167 transitions. [2019-12-18 13:08:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:08:07,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:07,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:07,984 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash 802741009, now seen corresponding path program 1 times [2019-12-18 13:08:07,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:07,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486831211] [2019-12-18 13:08:07,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:08,067 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-18 13:08:08,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486831211] [2019-12-18 13:08:08,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:08,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:08:08,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740093330] [2019-12-18 13:08:08,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:08:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:08:08,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:08:08,070 INFO L87 Difference]: Start difference. First operand 48011 states and 163167 transitions. Second operand 4 states. [2019-12-18 13:08:08,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:08,104 INFO L93 Difference]: Finished difference Result 5081 states and 12972 transitions. [2019-12-18 13:08:08,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:08:08,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:08:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:08,110 INFO L225 Difference]: With dead ends: 5081 [2019-12-18 13:08:08,111 INFO L226 Difference]: Without dead ends: 5081 [2019-12-18 13:08:08,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:08:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-12-18 13:08:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2019-12-18 13:08:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-12-18 13:08:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 12972 transitions. [2019-12-18 13:08:08,172 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 12972 transitions. Word has length 14 [2019-12-18 13:08:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:08,172 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 12972 transitions. [2019-12-18 13:08:08,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:08:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 12972 transitions. [2019-12-18 13:08:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:08:08,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:08,175 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-18 13:08:08,175 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1593078696, now seen corresponding path program 1 times [2019-12-18 13:08:08,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:08,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031674424] [2019-12-18 13:08:08,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:08,576 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-18 13:08:08,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031674424] [2019-12-18 13:08:08,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:08,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:08:08,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111267627] [2019-12-18 13:08:08,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:08,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:08,579 INFO L87 Difference]: Start difference. First operand 5081 states and 12972 transitions. Second operand 5 states. [2019-12-18 13:08:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:08,610 INFO L93 Difference]: Finished difference Result 1979 states and 5224 transitions. [2019-12-18 13:08:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:08:08,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:08:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:08,615 INFO L225 Difference]: With dead ends: 1979 [2019-12-18 13:08:08,615 INFO L226 Difference]: Without dead ends: 1979 [2019-12-18 13:08:08,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-18 13:08:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1881. [2019-12-18 13:08:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-18 13:08:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4993 transitions. [2019-12-18 13:08:08,658 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4993 transitions. Word has length 26 [2019-12-18 13:08:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:08,658 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4993 transitions. [2019-12-18 13:08:08,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4993 transitions. [2019-12-18 13:08:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 13:08:08,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:08,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:08,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash 76160980, now seen corresponding path program 1 times [2019-12-18 13:08:08,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:08,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701014448] [2019-12-18 13:08:08,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:08,903 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-18 13:08:08,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701014448] [2019-12-18 13:08:08,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:08,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:08:08,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541191138] [2019-12-18 13:08:08,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:08,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:08,907 INFO L87 Difference]: Start difference. First operand 1881 states and 4993 transitions. Second operand 5 states. [2019-12-18 13:08:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:09,451 INFO L93 Difference]: Finished difference Result 2818 states and 7401 transitions. [2019-12-18 13:08:09,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:08:09,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-18 13:08:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:09,456 INFO L225 Difference]: With dead ends: 2818 [2019-12-18 13:08:09,456 INFO L226 Difference]: Without dead ends: 2818 [2019-12-18 13:08:09,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-18 13:08:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2057. [2019-12-18 13:08:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-12-18 13:08:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 5485 transitions. [2019-12-18 13:08:09,488 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 5485 transitions. Word has length 71 [2019-12-18 13:08:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:09,489 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 5485 transitions. [2019-12-18 13:08:09,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 5485 transitions. [2019-12-18 13:08:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 13:08:09,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:09,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:09,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash -789175518, now seen corresponding path program 2 times [2019-12-18 13:08:09,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:09,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402499999] [2019-12-18 13:08:09,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:09,626 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-18 13:08:09,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402499999] [2019-12-18 13:08:09,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:09,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:09,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844628382] [2019-12-18 13:08:09,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:09,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:09,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:09,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:09,630 INFO L87 Difference]: Start difference. First operand 2057 states and 5485 transitions. Second operand 6 states. [2019-12-18 13:08:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:10,250 INFO L93 Difference]: Finished difference Result 2346 states and 6185 transitions. [2019-12-18 13:08:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:08:10,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-18 13:08:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:10,256 INFO L225 Difference]: With dead ends: 2346 [2019-12-18 13:08:10,257 INFO L226 Difference]: Without dead ends: 2346 [2019-12-18 13:08:10,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-12-18 13:08:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2127. [2019-12-18 13:08:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-18 13:08:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 5650 transitions. [2019-12-18 13:08:10,297 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 5650 transitions. Word has length 71 [2019-12-18 13:08:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:10,299 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 5650 transitions. [2019-12-18 13:08:10,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 5650 transitions. [2019-12-18 13:08:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 13:08:10,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:10,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:10,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 920625250, now seen corresponding path program 3 times [2019-12-18 13:08:10,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:10,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64518081] [2019-12-18 13:08:10,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:10,468 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-18 13:08:10,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64518081] [2019-12-18 13:08:10,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:10,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:10,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806511087] [2019-12-18 13:08:10,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:10,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:10,472 INFO L87 Difference]: Start difference. First operand 2127 states and 5650 transitions. Second operand 6 states. [2019-12-18 13:08:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:10,974 INFO L93 Difference]: Finished difference Result 3285 states and 8595 transitions. [2019-12-18 13:08:10,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:08:10,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-18 13:08:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:10,978 INFO L225 Difference]: With dead ends: 3285 [2019-12-18 13:08:10,979 INFO L226 Difference]: Without dead ends: 3285 [2019-12-18 13:08:10,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-12-18 13:08:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2411. [2019-12-18 13:08:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-18 13:08:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6298 transitions. [2019-12-18 13:08:11,009 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6298 transitions. Word has length 71 [2019-12-18 13:08:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:11,010 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 6298 transitions. [2019-12-18 13:08:11,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6298 transitions. [2019-12-18 13:08:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:08:11,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:11,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:11,015 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1439498402, now seen corresponding path program 1 times [2019-12-18 13:08:11,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:11,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786590445] [2019-12-18 13:08:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:11,103 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-18 13:08:11,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786590445] [2019-12-18 13:08:11,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:11,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:11,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130300572] [2019-12-18 13:08:11,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:11,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:11,107 INFO L87 Difference]: Start difference. First operand 2411 states and 6298 transitions. Second operand 3 states. [2019-12-18 13:08:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:11,152 INFO L93 Difference]: Finished difference Result 2410 states and 6296 transitions. [2019-12-18 13:08:11,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:11,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-18 13:08:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:11,156 INFO L225 Difference]: With dead ends: 2410 [2019-12-18 13:08:11,157 INFO L226 Difference]: Without dead ends: 2410 [2019-12-18 13:08:11,157 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-18 13:08:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2019-12-18 13:08:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2161. [2019-12-18 13:08:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2019-12-18 13:08:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 5716 transitions. [2019-12-18 13:08:11,188 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 5716 transitions. Word has length 72 [2019-12-18 13:08:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:11,188 INFO L462 AbstractCegarLoop]: Abstraction has 2161 states and 5716 transitions. [2019-12-18 13:08:11,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 5716 transitions. [2019-12-18 13:08:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:08:11,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:11,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:11,192 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:11,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2080066259, now seen corresponding path program 1 times [2019-12-18 13:08:11,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:11,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488039607] [2019-12-18 13:08:11,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:11,285 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-18 13:08:11,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488039607] [2019-12-18 13:08:11,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:11,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:11,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54205663] [2019-12-18 13:08:11,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:11,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:11,288 INFO L87 Difference]: Start difference. First operand 2161 states and 5716 transitions. Second operand 6 states. [2019-12-18 13:08:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:11,809 INFO L93 Difference]: Finished difference Result 2684 states and 7005 transitions. [2019-12-18 13:08:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:08:11,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-18 13:08:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:11,814 INFO L225 Difference]: With dead ends: 2684 [2019-12-18 13:08:11,814 INFO L226 Difference]: Without dead ends: 2684 [2019-12-18 13:08:11,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-12-18 13:08:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2189. [2019-12-18 13:08:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-12-18 13:08:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 5782 transitions. [2019-12-18 13:08:11,843 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 5782 transitions. Word has length 72 [2019-12-18 13:08:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:11,844 INFO L462 AbstractCegarLoop]: Abstraction has 2189 states and 5782 transitions. [2019-12-18 13:08:11,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 5782 transitions. [2019-12-18 13:08:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:11,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:11,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:11,848 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -298102113, now seen corresponding path program 1 times [2019-12-18 13:08:11,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:11,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215733228] [2019-12-18 13:08:11,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:11,917 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-18 13:08:11,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215733228] [2019-12-18 13:08:11,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:11,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:11,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980384596] [2019-12-18 13:08:11,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:11,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:11,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:11,919 INFO L87 Difference]: Start difference. First operand 2189 states and 5782 transitions. Second operand 3 states. [2019-12-18 13:08:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:11,937 INFO L93 Difference]: Finished difference Result 2057 states and 5320 transitions. [2019-12-18 13:08:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:11,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-18 13:08:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:11,940 INFO L225 Difference]: With dead ends: 2057 [2019-12-18 13:08:11,941 INFO L226 Difference]: Without dead ends: 2057 [2019-12-18 13:08:11,941 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-18 13:08:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-12-18 13:08:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2025. [2019-12-18 13:08:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-12-18 13:08:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5244 transitions. [2019-12-18 13:08:11,971 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5244 transitions. Word has length 73 [2019-12-18 13:08:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:11,971 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 5244 transitions. [2019-12-18 13:08:11,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5244 transitions. [2019-12-18 13:08:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:11,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:11,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:11,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:11,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1480966909, now seen corresponding path program 1 times [2019-12-18 13:08:11,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:11,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791272339] [2019-12-18 13:08:11,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:12,104 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-18 13:08:12,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791272339] [2019-12-18 13:08:12,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:12,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:12,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980549172] [2019-12-18 13:08:12,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:12,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:12,106 INFO L87 Difference]: Start difference. First operand 2025 states and 5244 transitions. Second operand 6 states. [2019-12-18 13:08:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:13,206 INFO L93 Difference]: Finished difference Result 2998 states and 7710 transitions. [2019-12-18 13:08:13,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:08:13,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-18 13:08:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:13,211 INFO L225 Difference]: With dead ends: 2998 [2019-12-18 13:08:13,211 INFO L226 Difference]: Without dead ends: 2998 [2019-12-18 13:08:13,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-12-18 13:08:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2385. [2019-12-18 13:08:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2385 states. [2019-12-18 13:08:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 6196 transitions. [2019-12-18 13:08:13,264 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 6196 transitions. Word has length 73 [2019-12-18 13:08:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:13,265 INFO L462 AbstractCegarLoop]: Abstraction has 2385 states and 6196 transitions. [2019-12-18 13:08:13,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 6196 transitions. [2019-12-18 13:08:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:13,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:13,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:13,271 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2120547763, now seen corresponding path program 2 times [2019-12-18 13:08:13,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:13,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242253191] [2019-12-18 13:08:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:13,428 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-18 13:08:13,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242253191] [2019-12-18 13:08:13,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:13,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:08:13,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997652618] [2019-12-18 13:08:13,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:08:13,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:08:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:13,431 INFO L87 Difference]: Start difference. First operand 2385 states and 6196 transitions. Second operand 7 states. [2019-12-18 13:08:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:13,956 INFO L93 Difference]: Finished difference Result 3520 states and 9097 transitions. [2019-12-18 13:08:13,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:08:13,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 13:08:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:13,963 INFO L225 Difference]: With dead ends: 3520 [2019-12-18 13:08:13,963 INFO L226 Difference]: Without dead ends: 3520 [2019-12-18 13:08:13,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:08:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3520 states. [2019-12-18 13:08:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3520 to 2391. [2019-12-18 13:08:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2391 states. [2019-12-18 13:08:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 6211 transitions. [2019-12-18 13:08:14,012 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 6211 transitions. Word has length 73 [2019-12-18 13:08:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:14,012 INFO L462 AbstractCegarLoop]: Abstraction has 2391 states and 6211 transitions. [2019-12-18 13:08:14,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:08:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 6211 transitions. [2019-12-18 13:08:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:14,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:14,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:14,018 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1787574207, now seen corresponding path program 3 times [2019-12-18 13:08:14,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:14,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838221025] [2019-12-18 13:08:14,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:14,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838221025] [2019-12-18 13:08:14,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:14,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:08:14,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940237492] [2019-12-18 13:08:14,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:08:14,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:08:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:08:14,351 INFO L87 Difference]: Start difference. First operand 2391 states and 6211 transitions. Second operand 10 states. [2019-12-18 13:08:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:15,376 INFO L93 Difference]: Finished difference Result 4661 states and 12140 transitions. [2019-12-18 13:08:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:08:15,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-18 13:08:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:15,384 INFO L225 Difference]: With dead ends: 4661 [2019-12-18 13:08:15,384 INFO L226 Difference]: Without dead ends: 4661 [2019-12-18 13:08:15,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:08:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-12-18 13:08:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 2959. [2019-12-18 13:08:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2019-12-18 13:08:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 7825 transitions. [2019-12-18 13:08:15,438 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 7825 transitions. Word has length 73 [2019-12-18 13:08:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:15,439 INFO L462 AbstractCegarLoop]: Abstraction has 2959 states and 7825 transitions. [2019-12-18 13:08:15,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:08:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 7825 transitions. [2019-12-18 13:08:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:15,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:15,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:15,443 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1349965733, now seen corresponding path program 4 times [2019-12-18 13:08:15,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:15,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17568568] [2019-12-18 13:08:15,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:15,555 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-18 13:08:15,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17568568] [2019-12-18 13:08:15,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:15,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:15,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285985431] [2019-12-18 13:08:15,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:15,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:15,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:15,557 INFO L87 Difference]: Start difference. First operand 2959 states and 7825 transitions. Second operand 6 states. [2019-12-18 13:08:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:15,983 INFO L93 Difference]: Finished difference Result 4570 states and 12000 transitions. [2019-12-18 13:08:15,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:08:15,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-18 13:08:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:15,989 INFO L225 Difference]: With dead ends: 4570 [2019-12-18 13:08:15,989 INFO L226 Difference]: Without dead ends: 4570 [2019-12-18 13:08:15,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2019-12-18 13:08:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3215. [2019-12-18 13:08:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3215 states. [2019-12-18 13:08:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 8481 transitions. [2019-12-18 13:08:16,034 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 8481 transitions. Word has length 73 [2019-12-18 13:08:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:16,034 INFO L462 AbstractCegarLoop]: Abstraction has 3215 states and 8481 transitions. [2019-12-18 13:08:16,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 8481 transitions. [2019-12-18 13:08:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:16,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:16,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:16,039 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1267108309, now seen corresponding path program 5 times [2019-12-18 13:08:16,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:16,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528477144] [2019-12-18 13:08:16,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:16,238 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-18 13:08:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528477144] [2019-12-18 13:08:16,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:16,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:08:16,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112872851] [2019-12-18 13:08:16,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:16,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:16,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:16,242 INFO L87 Difference]: Start difference. First operand 3215 states and 8481 transitions. Second operand 6 states. [2019-12-18 13:08:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:16,580 INFO L93 Difference]: Finished difference Result 3669 states and 9658 transitions. [2019-12-18 13:08:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:08:16,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-18 13:08:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:16,586 INFO L225 Difference]: With dead ends: 3669 [2019-12-18 13:08:16,587 INFO L226 Difference]: Without dead ends: 3669 [2019-12-18 13:08:16,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:08:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-12-18 13:08:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3215. [2019-12-18 13:08:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3215 states. [2019-12-18 13:08:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 8417 transitions. [2019-12-18 13:08:16,643 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 8417 transitions. Word has length 73 [2019-12-18 13:08:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:16,643 INFO L462 AbstractCegarLoop]: Abstraction has 3215 states and 8417 transitions. [2019-12-18 13:08:16,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 8417 transitions. [2019-12-18 13:08:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:08:16,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:16,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:16,648 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1431998849, now seen corresponding path program 6 times [2019-12-18 13:08:16,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:16,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630257840] [2019-12-18 13:08:16,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:16,921 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-18 13:08:16,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630257840] [2019-12-18 13:08:16,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:16,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:08:16,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716769572] [2019-12-18 13:08:16,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:08:16,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:08:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:08:16,924 INFO L87 Difference]: Start difference. First operand 3215 states and 8417 transitions. Second operand 10 states. [2019-12-18 13:08:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:17,985 INFO L93 Difference]: Finished difference Result 5710 states and 14814 transitions. [2019-12-18 13:08:17,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:08:17,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-18 13:08:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:17,993 INFO L225 Difference]: With dead ends: 5710 [2019-12-18 13:08:17,993 INFO L226 Difference]: Without dead ends: 5710 [2019-12-18 13:08:17,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:08:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2019-12-18 13:08:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 2767. [2019-12-18 13:08:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2767 states. [2019-12-18 13:08:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 7253 transitions. [2019-12-18 13:08:18,033 INFO L78 Accepts]: Start accepts. Automaton has 2767 states and 7253 transitions. Word has length 73 [2019-12-18 13:08:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 2767 states and 7253 transitions. [2019-12-18 13:08:18,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:08:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2767 states and 7253 transitions. [2019-12-18 13:08:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:08:18,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:18,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:18,037 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash 95378273, now seen corresponding path program 1 times [2019-12-18 13:08:18,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:18,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948035776] [2019-12-18 13:08:18,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:18,154 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-18 13:08:18,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948035776] [2019-12-18 13:08:18,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:18,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:08:18,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123746463] [2019-12-18 13:08:18,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:18,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:18,162 INFO L87 Difference]: Start difference. First operand 2767 states and 7253 transitions. Second operand 6 states. [2019-12-18 13:08:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:18,306 INFO L93 Difference]: Finished difference Result 4437 states and 10937 transitions. [2019-12-18 13:08:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:08:18,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 13:08:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:18,309 INFO L225 Difference]: With dead ends: 4437 [2019-12-18 13:08:18,309 INFO L226 Difference]: Without dead ends: 1891 [2019-12-18 13:08:18,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2019-12-18 13:08:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1587. [2019-12-18 13:08:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-12-18 13:08:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 3504 transitions. [2019-12-18 13:08:18,326 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 3504 transitions. Word has length 74 [2019-12-18 13:08:18,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:18,326 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 3504 transitions. [2019-12-18 13:08:18,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 3504 transitions. [2019-12-18 13:08:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:08:18,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:18,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:18,328 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1817677093, now seen corresponding path program 2 times [2019-12-18 13:08:18,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:18,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311331554] [2019-12-18 13:08:18,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:18,440 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-18 13:08:18,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311331554] [2019-12-18 13:08:18,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:18,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:08:18,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440974515] [2019-12-18 13:08:18,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:08:18,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:18,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:08:18,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:08:18,442 INFO L87 Difference]: Start difference. First operand 1587 states and 3504 transitions. Second operand 4 states. [2019-12-18 13:08:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:18,471 INFO L93 Difference]: Finished difference Result 1780 states and 3846 transitions. [2019-12-18 13:08:18,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:08:18,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-18 13:08:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:18,472 INFO L225 Difference]: With dead ends: 1780 [2019-12-18 13:08:18,472 INFO L226 Difference]: Without dead ends: 271 [2019-12-18 13:08:18,472 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-18 13:08:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-18 13:08:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-12-18 13:08:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-18 13:08:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 458 transitions. [2019-12-18 13:08:18,476 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 458 transitions. Word has length 74 [2019-12-18 13:08:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:18,476 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 458 transitions. [2019-12-18 13:08:18,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:08:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 458 transitions. [2019-12-18 13:08:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:08:18,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:18,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:18,478 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -398575509, now seen corresponding path program 3 times [2019-12-18 13:08:18,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:18,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110856107] [2019-12-18 13:08:18,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:19,111 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-18 13:08:19,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110856107] [2019-12-18 13:08:19,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:19,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 13:08:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047881453] [2019-12-18 13:08:19,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 13:08:19,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 13:08:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:08:19,113 INFO L87 Difference]: Start difference. First operand 271 states and 458 transitions. Second operand 19 states. [2019-12-18 13:08:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:21,223 INFO L93 Difference]: Finished difference Result 1010 states and 1777 transitions. [2019-12-18 13:08:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:08:21,224 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2019-12-18 13:08:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:21,225 INFO L225 Difference]: With dead ends: 1010 [2019-12-18 13:08:21,225 INFO L226 Difference]: Without dead ends: 980 [2019-12-18 13:08:21,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1453, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 13:08:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-12-18 13:08:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 376. [2019-12-18 13:08:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-18 13:08:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 632 transitions. [2019-12-18 13:08:21,232 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 632 transitions. Word has length 74 [2019-12-18 13:08:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:21,233 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 632 transitions. [2019-12-18 13:08:21,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 13:08:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 632 transitions. [2019-12-18 13:08:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:08:21,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:21,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:21,234 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -854626243, now seen corresponding path program 4 times [2019-12-18 13:08:21,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:21,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448717687] [2019-12-18 13:08:21,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:21,427 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-18 13:08:21,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448717687] [2019-12-18 13:08:21,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:21,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:08:21,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088386922] [2019-12-18 13:08:21,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:08:21,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:08:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:08:21,429 INFO L87 Difference]: Start difference. First operand 376 states and 632 transitions. Second operand 11 states. [2019-12-18 13:08:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:21,829 INFO L93 Difference]: Finished difference Result 524 states and 875 transitions. [2019-12-18 13:08:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:08:21,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-18 13:08:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:21,830 INFO L225 Difference]: With dead ends: 524 [2019-12-18 13:08:21,830 INFO L226 Difference]: Without dead ends: 494 [2019-12-18 13:08:21,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:08:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-12-18 13:08:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 405. [2019-12-18 13:08:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-18 13:08:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 685 transitions. [2019-12-18 13:08:21,838 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 685 transitions. Word has length 74 [2019-12-18 13:08:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:21,838 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 685 transitions. [2019-12-18 13:08:21,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:08:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 685 transitions. [2019-12-18 13:08:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:08:21,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:21,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:21,840 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2034928915, now seen corresponding path program 5 times [2019-12-18 13:08:21,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:21,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047469988] [2019-12-18 13:08:21,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:08:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:08:21,985 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:08:21,985 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:08:21,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~y$r_buff1_thd1~0_137 0) (= v_~y$flush_delayed~0_201 0) (= v_~y$r_buff1_thd0~0_323 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27|) |v_ULTIMATE.start_main_~#t766~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd2~0_124) (= v_~y$w_buff1_used~0_443 0) (= 0 v_~y$r_buff1_thd3~0_282) (= 0 v_~y$r_buff0_thd3~0_461) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t766~0.base_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27| 1) |v_#valid_61|) (= 0 v_~y$w_buff0~0_180) (= v_~main$tmp_guard1~0_34 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t766~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd2~0_202) (= v_~y$r_buff0_thd0~0_357 0) (= v_~y$r_buff0_thd1~0_62 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= |v_ULTIMATE.start_main_~#t766~0.offset_21| 0) (= v_~y~0_276 0) (= v_~z~0_23 0) (= v_~weak$$choice2~0_236 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_5| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27|) 0) (= v_~y$mem_tmp~0_174 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_86) (= 0 v_~__unbuffered_p2_EAX~0_30) (= v_~x~0_36 0) (= v_~y$w_buff0_used~0_864 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t766~0.base=|v_ULTIMATE.start_main_~#t766~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_27|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_65|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_25|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_52|, ~y$mem_tmp~0=v_~y$mem_tmp~0_174, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_201, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_53|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_122|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_29|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t766~0.offset=|v_ULTIMATE.start_main_~#t766~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_323, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_864, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_53|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_55|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_75|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_38|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_137, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_46|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_461, ~y~0=v_~y~0_276, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_25|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_36|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_39|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_58|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_84|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_202, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_35|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_43|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_19|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t766~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t767~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t766~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t768~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t768~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t767~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:08:21,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L818-1-->L820: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t767~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t767~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t767~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11|) |v_ULTIMATE.start_main_~#t767~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t767~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_17|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t767~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t767~0.base] because there is no mapped edge [2019-12-18 13:08:21,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t768~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t768~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12|) |v_ULTIMATE.start_main_~#t768~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t768~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_12|, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t768~0.base, ULTIMATE.start_main_~#t768~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:08:21,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= 1 v_~y$r_buff0_thd3~0_204) (= v_~weak$$choice2~0_87 v_~y$flush_delayed~0_53) (= |v_P2Thread1of1ForFork1_#t~nondet10_46| v_~weak$$choice2~0_87) (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_57) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= |v_P2Thread1of1ForFork1_#t~nondet9_46| v_~weak$$choice0~0_41) (= v_~y$r_buff0_thd3~0_205 v_~y$r_buff1_thd3~0_107) (= v_~y~0_105 v_~y$mem_tmp~0_43) (= v_~y$r_buff0_thd0~0_153 v_~y$r_buff1_thd0~0_106) (= v_~y$r_buff0_thd1~0_24 v_~y$r_buff1_thd1~0_24)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_46|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_46|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_105, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_45|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_45|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_57, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_107, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_204, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~y~0=v_~y~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:08:21,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-1132299015| |P2Thread1of1ForFork1_#t~ite12_Out-1132299015|)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1132299015 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1132299015 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out-1132299015| ~y$w_buff1~0_In-1132299015) (or .cse0 .cse1) .cse2) (and .cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-1132299015| ~y$w_buff0~0_In-1132299015) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1132299015, ~y$w_buff1~0=~y$w_buff1~0_In-1132299015, ~y$w_buff0~0=~y$w_buff0~0_In-1132299015, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1132299015} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1132299015, ~y$w_buff1~0=~y$w_buff1~0_In-1132299015, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1132299015|, ~y$w_buff0~0=~y$w_buff0~0_In-1132299015, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1132299015, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1132299015|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:08:22,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_81 256) 0)) (= v_~y$r_buff0_thd3~0_181 v_~y$r_buff0_thd3~0_180)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_13|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_12|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:08:22,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1512314992 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite31_Out-1512314992| ~y$mem_tmp~0_In-1512314992)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite31_Out-1512314992| ~y~0_In-1512314992)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1512314992, ~y$flush_delayed~0=~y$flush_delayed~0_In-1512314992, ~y~0=~y~0_In-1512314992} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1512314992, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out-1512314992|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1512314992, ~y~0=~y~0_In-1512314992} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 13:08:22,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_19 1) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~z~0=v_~z~0_19, ~x~0=v_~x~0_21, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 13:08:22,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1844205198 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1844205198 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1844205198|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1844205198| ~y$w_buff0_used~0_In1844205198)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1844205198, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1844205198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1844205198, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1844205198|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1844205198} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:08:22,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1646414113| |P1Thread1of1ForFork0_#t~ite3_Out-1646414113|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1646414113 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1646414113 256) 0))) (or (and (= ~y~0_In-1646414113 |P1Thread1of1ForFork0_#t~ite3_Out-1646414113|) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out-1646414113| ~y$w_buff1~0_In-1646414113) .cse0 (not .cse1) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1646414113, ~y$w_buff1~0=~y$w_buff1~0_In-1646414113, ~y~0=~y~0_In-1646414113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1646414113} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1646414113, ~y$w_buff1~0=~y$w_buff1~0_In-1646414113, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1646414113|, ~y~0=~y~0_In-1646414113, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1646414113|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1646414113} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:08:22,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1794265301 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1794265301 256) 0))) (or (and (= ~y$w_buff0_used~0_In1794265301 |P1Thread1of1ForFork0_#t~ite5_Out1794265301|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1794265301|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1794265301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1794265301} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1794265301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1794265301, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1794265301|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:08:22,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In910400669 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In910400669 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In910400669 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In910400669 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out910400669|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite6_Out910400669| ~y$w_buff1_used~0_In910400669) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In910400669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In910400669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In910400669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In910400669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In910400669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In910400669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In910400669, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out910400669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In910400669} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:08:22,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1738508611 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1738508611 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out1738508611|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out1738508611| ~y$r_buff0_thd2~0_In1738508611)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1738508611, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1738508611} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1738508611, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1738508611, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1738508611|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:08:22,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1208895164 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1208895164 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1208895164 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1208895164 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1208895164 |P1Thread1of1ForFork0_#t~ite8_Out1208895164|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out1208895164|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1208895164, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1208895164, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1208895164, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208895164} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1208895164, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1208895164, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1208895164, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out1208895164|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208895164} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:08:22,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_75 |v_P1Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_75, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_27|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:08:22,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1410686222 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1410686222 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1410686222 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1410686222 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1410686222 |P2Thread1of1ForFork1_#t~ite35_Out-1410686222|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1410686222|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1410686222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410686222, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1410686222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1410686222} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1410686222|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1410686222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410686222, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1410686222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1410686222} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:08:22,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1990178211 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1990178211 256)))) (or (and (= ~y$r_buff0_thd3~0_Out1990178211 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out1990178211 ~y$r_buff0_thd3~0_In1990178211) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1990178211, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1990178211} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1990178211|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990178211, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1990178211} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:08:22,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-944554646 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-944554646 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-944554646 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-944554646 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-944554646| ~y$r_buff1_thd3~0_In-944554646) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-944554646| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-944554646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-944554646, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-944554646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-944554646} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-944554646, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-944554646|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-944554646, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-944554646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-944554646} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:08:22,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_34| v_~y$r_buff1_thd3~0_143) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:08:22,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:08:22,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1018220901 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1018220901 256) 0))) (or (and (= ~y~0_In1018220901 |ULTIMATE.start_main_#t~ite41_Out1018220901|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In1018220901 |ULTIMATE.start_main_#t~ite41_Out1018220901|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1018220901, ~y~0=~y~0_In1018220901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1018220901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1018220901} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1018220901|, ~y$w_buff1~0=~y$w_buff1~0_In1018220901, ~y~0=~y~0_In1018220901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1018220901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1018220901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 13:08:22,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_57 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:08:22,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In174331796 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In174331796 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out174331796| ~y$w_buff0_used~0_In174331796)) (and (= |ULTIMATE.start_main_#t~ite43_Out174331796| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In174331796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In174331796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In174331796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In174331796, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out174331796|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:08:22,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2132484384 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In2132484384 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2132484384 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2132484384 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out2132484384|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite44_Out2132484384| ~y$w_buff1_used~0_In2132484384) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2132484384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2132484384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2132484384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132484384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2132484384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2132484384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2132484384, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2132484384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132484384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:08:22,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1395612929 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1395612929 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1395612929| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1395612929| ~y$r_buff0_thd0~0_In-1395612929)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395612929, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1395612929} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395612929, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1395612929, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1395612929|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:08:22,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1924480150 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1924480150 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1924480150 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1924480150 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1924480150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-1924480150| ~y$r_buff1_thd0~0_In-1924480150) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924480150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1924480150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1924480150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924480150} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924480150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1924480150, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1924480150|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1924480150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924480150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 13:08:22,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1739001719 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite69_Out1739001719| ~y~0_In1739001719)) (and (not .cse0) (= ~y$mem_tmp~0_In1739001719 |ULTIMATE.start_main_#t~ite69_Out1739001719|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1739001719, ~y$flush_delayed~0=~y$flush_delayed~0_In1739001719, ~y~0=~y~0_In1739001719} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1739001719, ~y$flush_delayed~0=~y$flush_delayed~0_In1739001719, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1739001719|, ~y~0=~y~0_In1739001719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-18 13:08:22,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_265 |v_ULTIMATE.start_main_#t~ite69_41|) (= v_~y$flush_delayed~0_194 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_40|, ~y~0=v_~y~0_265, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:08:22,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:08:22 BasicIcfg [2019-12-18 13:08:22,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:08:22,178 INFO L168 Benchmark]: Toolchain (without parser) took 47096.02 ms. Allocated memory was 137.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 101.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 198.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,179 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.75 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 154.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.53 ms. Allocated memory is still 201.9 MB. Free memory was 154.1 MB in the beginning and 150.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,181 INFO L168 Benchmark]: Boogie Preprocessor took 42.37 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,182 INFO L168 Benchmark]: RCFGBuilder took 976.88 ms. Allocated memory is still 201.9 MB. Free memory was 147.9 MB in the beginning and 90.0 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,184 INFO L168 Benchmark]: TraceAbstraction took 45109.47 ms. Allocated memory was 201.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 89.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:22,188 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.52 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.75 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 154.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.53 ms. Allocated memory is still 201.9 MB. Free memory was 154.1 MB in the beginning and 150.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.37 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 976.88 ms. Allocated memory is still 201.9 MB. Free memory was 147.9 MB in the beginning and 90.0 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45109.47 ms. Allocated memory was 201.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 89.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 205 ProgramPointsBefore, 120 ProgramPointsAfterwards, 257 TransitionsBefore, 143 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 56 ConcurrentYvCompositions, 33 ChoiceCompositions, 9380 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 65 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 165402 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 44.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3985 SDtfs, 4202 SDslu, 10363 SDs, 0 SdLazy, 6975 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 66 SyntacticMatches, 38 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87886occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 14535 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 293329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...