/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/mix001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:06:33,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:06:33,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:06:33,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:06:33,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:06:33,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:06:33,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:06:33,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:06:33,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:06:33,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:06:33,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:06:33,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:06:33,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:06:33,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:06:33,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:06:33,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:06:33,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:06:33,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:06:33,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:06:33,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:06:33,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:06:33,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:06:33,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:06:33,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:06:33,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:06:33,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:06:33,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:06:33,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:06:33,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:06:33,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:06:33,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:06:33,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:06:33,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:06:33,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:06:33,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:06:33,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:06:33,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:06:33,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:06:33,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:06:33,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:06:33,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:06:33,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:06:33,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:06:33,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:06:33,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:06:33,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:06:33,862 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:06:33,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:06:33,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:06:33,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:06:33,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:06:33,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:06:33,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:06:33,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:06:33,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:06:33,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:06:33,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:06:33,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:06:33,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:06:33,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:06:33,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:06:33,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:06:33,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:06:33,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:06:33,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:06:33,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:06:33,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:06:33,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:06:33,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:06:33,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:06:33,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:06:33,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:06:34,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:06:34,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:06:34,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:06:34,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:06:34,163 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:06:34,164 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2019-12-26 21:06:34,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09979386c/238c5eb82d58426693c03071c5b793ca/FLAG5e05dab34 [2019-12-26 21:06:34,825 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:06:34,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2019-12-26 21:06:34,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09979386c/238c5eb82d58426693c03071c5b793ca/FLAG5e05dab34 [2019-12-26 21:06:35,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09979386c/238c5eb82d58426693c03071c5b793ca [2019-12-26 21:06:35,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:06:35,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:06:35,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:06:35,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:06:35,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:06:35,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35, skipping insertion in model container [2019-12-26 21:06:35,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:06:35,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:06:35,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:06:35,697 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:06:35,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:06:35,851 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:06:35,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35 WrapperNode [2019-12-26 21:06:35,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:06:35,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:06:35,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:06:35,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:06:35,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:06:35,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:06:35,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:06:35,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:06:35,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (1/1) ... [2019-12-26 21:06:35,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:06:35,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:06:35,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:06:35,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:06:35,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06: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-26 21:06:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:06:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:06:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:06:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:06:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:06:36,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:06:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:06:36,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:06:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:06:36,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:06:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:06:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:06:36,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:06:36,048 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:06:37,061 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:06:37,061 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:06:37,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:06:37 BoogieIcfgContainer [2019-12-26 21:06:37,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:06:37,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:06:37,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:06:37,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:06:37,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:06:35" (1/3) ... [2019-12-26 21:06:37,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0cdcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:06:37, skipping insertion in model container [2019-12-26 21:06:37,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:35" (2/3) ... [2019-12-26 21:06:37,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0cdcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:06:37, skipping insertion in model container [2019-12-26 21:06:37,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:06:37" (3/3) ... [2019-12-26 21:06:37,074 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i [2019-12-26 21:06:37,085 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:06:37,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:06:37,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:06:37,097 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:06:37,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,225 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,266 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:37,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:06:37,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:06:37,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:06:37,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:06:37,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:06:37,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:06:37,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:06:37,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:06:37,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:06:37,349 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-26 21:06:37,351 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-26 21:06:37,489 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-26 21:06:37,489 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:06:37,508 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:06:37,538 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-26 21:06:37,602 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-26 21:06:37,602 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:06:37,612 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:06:37,644 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-26 21:06:37,645 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:06:44,017 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 21:06:44,153 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 21:06:44,218 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-26 21:06:44,218 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-26 21:06:44,221 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-26 21:06:47,943 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-26 21:06:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-26 21:06:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:06:47,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:47,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:47,954 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-26 21:06:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-26 21:06:47,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:47,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592179564] [2019-12-26 21:06:47,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:06:48,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592179564] [2019-12-26 21:06:48,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:48,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:06:48,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958567274] [2019-12-26 21:06:48,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:06:48,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:06:48,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:48,303 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-26 21:06:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:49,108 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-26 21:06:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:06:49,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:06:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:50,638 INFO L225 Difference]: With dead ends: 44562 [2019-12-26 21:06:50,638 INFO L226 Difference]: Without dead ends: 41502 [2019-12-26 21:06:50,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-26 21:06:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-26 21:06:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-26 21:06:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-26 21:06:54,745 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-26 21:06:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:54,746 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-26 21:06:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:06:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-26 21:06:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:06:54,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:54,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:54,759 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-26 21:06:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-26 21:06:54,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:54,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055099959] [2019-12-26 21:06:54,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:06:54,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055099959] [2019-12-26 21:06:54,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:54,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:06:54,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726459249] [2019-12-26 21:06:54,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:06:54,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:06:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:06:54,932 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-26 21:06:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:55,629 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-26 21:06:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:06:55,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:06:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:55,943 INFO L225 Difference]: With dead ends: 66122 [2019-12-26 21:06:55,943 INFO L226 Difference]: Without dead ends: 66092 [2019-12-26 21:06:55,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-26 21:06:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-26 21:06:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-26 21:07:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-26 21:07:02,612 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-26 21:07:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:02,613 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-26 21:07:02,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:07:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-26 21:07:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:07:02,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:02,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:07:02,619 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-26 21:07:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-26 21:07:02,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:02,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234870507] [2019-12-26 21:07:02,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:02,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234870507] [2019-12-26 21:07:02,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:02,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:07:02,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948819293] [2019-12-26 21:07:02,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:07:02,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:02,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:07:02,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:07:02,723 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-26 21:07:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:03,530 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-26 21:07:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:07:03,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:07:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:03,820 INFO L225 Difference]: With dead ends: 82254 [2019-12-26 21:07:03,820 INFO L226 Difference]: Without dead ends: 82226 [2019-12-26 21:07:03,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:07:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-26 21:07:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-26 21:07:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-26 21:07:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-26 21:07:07,731 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-26 21:07:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:07,731 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-26 21:07:07,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:07:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-26 21:07:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 21:07:07,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:07,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:07:07,744 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-26 21:07:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-26 21:07:07,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:07,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42836481] [2019-12-26 21:07:07,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:07,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42836481] [2019-12-26 21:07:07,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:07:07,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765113273] [2019-12-26 21:07:07,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:07:07,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:07:07,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:07,821 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-26 21:07:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:08,129 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-26 21:07:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:07:08,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 21:07:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:08,299 INFO L225 Difference]: With dead ends: 68874 [2019-12-26 21:07:08,299 INFO L226 Difference]: Without dead ends: 68874 [2019-12-26 21:07:08,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-26 21:07:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-26 21:07:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-26 21:07:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-26 21:07:11,379 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 18 [2019-12-26 21:07:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:11,380 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-26 21:07:11,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:07:11,380 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-26 21:07:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:07:11,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:11,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:07:11,408 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-26 21:07:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-26 21:07:11,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:11,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091353734] [2019-12-26 21:07:11,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:11,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091353734] [2019-12-26 21:07:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:07:11,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720843151] [2019-12-26 21:07:11,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:07:11,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:11,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:07:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:07:11,468 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-26 21:07:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:13,088 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-26 21:07:13,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:07:13,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:07:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:13,291 INFO L225 Difference]: With dead ends: 81922 [2019-12-26 21:07:13,291 INFO L226 Difference]: Without dead ends: 81870 [2019-12-26 21:07:13,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:07:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-26 21:07:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-26 21:07:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-26 21:07:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-26 21:07:18,497 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-26 21:07:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:18,497 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-26 21:07:18,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:07:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-26 21:07:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 21:07:18,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:18,584 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] [2019-12-26 21:07:18,584 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-26 21:07:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-26 21:07:18,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:18,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986303007] [2019-12-26 21:07:18,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:18,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986303007] [2019-12-26 21:07:18,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:18,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:07:18,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342414066] [2019-12-26 21:07:18,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:07:18,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:18,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:07:18,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:07:18,666 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 5 states. [2019-12-26 21:07:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:19,262 INFO L93 Difference]: Finished difference Result 103430 states and 412650 transitions. [2019-12-26 21:07:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:07:19,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-26 21:07:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:19,524 INFO L225 Difference]: With dead ends: 103430 [2019-12-26 21:07:19,524 INFO L226 Difference]: Without dead ends: 90822 [2019-12-26 21:07:19,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:07:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90822 states. [2019-12-26 21:07:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90822 to 90822. [2019-12-26 21:07:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90822 states. [2019-12-26 21:07:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90822 states to 90822 states and 363292 transitions. [2019-12-26 21:07:24,849 INFO L78 Accepts]: Start accepts. Automaton has 90822 states and 363292 transitions. Word has length 32 [2019-12-26 21:07:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:24,849 INFO L462 AbstractCegarLoop]: Abstraction has 90822 states and 363292 transitions. [2019-12-26 21:07:24,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:07:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 90822 states and 363292 transitions. [2019-12-26 21:07:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 21:07:24,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:24,953 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] [2019-12-26 21:07:24,953 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-26 21:07:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1864942543, now seen corresponding path program 2 times [2019-12-26 21:07:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:24,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259625109] [2019-12-26 21:07:24,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:25,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259625109] [2019-12-26 21:07:25,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:25,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:07:25,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599036852] [2019-12-26 21:07:25,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:07:25,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:07:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:25,008 INFO L87 Difference]: Start difference. First operand 90822 states and 363292 transitions. Second operand 3 states. [2019-12-26 21:07:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:26,307 INFO L93 Difference]: Finished difference Result 90770 states and 363112 transitions. [2019-12-26 21:07:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:07:26,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-26 21:07:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:26,554 INFO L225 Difference]: With dead ends: 90770 [2019-12-26 21:07:26,554 INFO L226 Difference]: Without dead ends: 90770 [2019-12-26 21:07:26,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90770 states. [2019-12-26 21:07:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90770 to 90770. [2019-12-26 21:07:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90770 states. [2019-12-26 21:07:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90770 states to 90770 states and 363112 transitions. [2019-12-26 21:07:32,360 INFO L78 Accepts]: Start accepts. Automaton has 90770 states and 363112 transitions. Word has length 32 [2019-12-26 21:07:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:32,361 INFO L462 AbstractCegarLoop]: Abstraction has 90770 states and 363112 transitions. [2019-12-26 21:07:32,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:07:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 90770 states and 363112 transitions. [2019-12-26 21:07:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:07:32,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:32,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:07:32,514 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-26 21:07:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1625131118, now seen corresponding path program 1 times [2019-12-26 21:07:32,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:32,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139729910] [2019-12-26 21:07:32,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:32,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139729910] [2019-12-26 21:07:32,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:32,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:07:32,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019220438] [2019-12-26 21:07:32,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:07:32,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:07:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:32,562 INFO L87 Difference]: Start difference. First operand 90770 states and 363112 transitions. Second operand 3 states. [2019-12-26 21:07:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:32,995 INFO L93 Difference]: Finished difference Result 89976 states and 359743 transitions. [2019-12-26 21:07:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:07:32,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-26 21:07:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:34,092 INFO L225 Difference]: With dead ends: 89976 [2019-12-26 21:07:34,093 INFO L226 Difference]: Without dead ends: 89976 [2019-12-26 21:07:34,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89976 states. [2019-12-26 21:07:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89976 to 89976. [2019-12-26 21:07:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89976 states. [2019-12-26 21:07:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89976 states to 89976 states and 359743 transitions. [2019-12-26 21:07:40,571 INFO L78 Accepts]: Start accepts. Automaton has 89976 states and 359743 transitions. Word has length 33 [2019-12-26 21:07:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:40,572 INFO L462 AbstractCegarLoop]: Abstraction has 89976 states and 359743 transitions. [2019-12-26 21:07:40,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:07:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 89976 states and 359743 transitions. [2019-12-26 21:07:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:07:40,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:40,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:07:40,708 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-26 21:07:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1074164756, now seen corresponding path program 1 times [2019-12-26 21:07:40,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:40,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698761271] [2019-12-26 21:07:40,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:40,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698761271] [2019-12-26 21:07:40,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:40,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:07:40,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743803399] [2019-12-26 21:07:40,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:07:40,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:07:40,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:07:40,787 INFO L87 Difference]: Start difference. First operand 89976 states and 359743 transitions. Second operand 4 states. [2019-12-26 21:07:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:41,847 INFO L93 Difference]: Finished difference Result 163667 states and 649420 transitions. [2019-12-26 21:07:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:07:41,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-26 21:07:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:43,191 INFO L225 Difference]: With dead ends: 163667 [2019-12-26 21:07:43,192 INFO L226 Difference]: Without dead ends: 163667 [2019-12-26 21:07:43,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:07:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163667 states. [2019-12-26 21:07:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163667 to 137507. [2019-12-26 21:07:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137507 states. [2019-12-26 21:07:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137507 states to 137507 states and 552051 transitions. [2019-12-26 21:07:49,023 INFO L78 Accepts]: Start accepts. Automaton has 137507 states and 552051 transitions. Word has length 34 [2019-12-26 21:07:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:07:49,024 INFO L462 AbstractCegarLoop]: Abstraction has 137507 states and 552051 transitions. [2019-12-26 21:07:49,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:07:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 137507 states and 552051 transitions. [2019-12-26 21:07:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:07:49,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:07:49,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:07:49,206 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-26 21:07:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:07:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1626828954, now seen corresponding path program 2 times [2019-12-26 21:07:49,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:07:49,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718197548] [2019-12-26 21:07:49,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:07:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:07:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:07:49,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718197548] [2019-12-26 21:07:49,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:07:49,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:07:49,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362613776] [2019-12-26 21:07:49,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:07:49,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:07:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:07:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:49,267 INFO L87 Difference]: Start difference. First operand 137507 states and 552051 transitions. Second operand 3 states. [2019-12-26 21:07:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:07:49,954 INFO L93 Difference]: Finished difference Result 136839 states and 540867 transitions. [2019-12-26 21:07:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:07:49,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-26 21:07:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:07:56,165 INFO L225 Difference]: With dead ends: 136839 [2019-12-26 21:07:56,165 INFO L226 Difference]: Without dead ends: 136839 [2019-12-26 21:07:56,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:07:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136839 states. [2019-12-26 21:07:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136839 to 136551. [2019-12-26 21:07:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136551 states. [2019-12-26 21:08:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136551 states to 136551 states and 539951 transitions. [2019-12-26 21:08:00,048 INFO L78 Accepts]: Start accepts. Automaton has 136551 states and 539951 transitions. Word has length 34 [2019-12-26 21:08:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:00,048 INFO L462 AbstractCegarLoop]: Abstraction has 136551 states and 539951 transitions. [2019-12-26 21:08:00,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:08:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 136551 states and 539951 transitions. [2019-12-26 21:08:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 21:08:00,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:00,227 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] [2019-12-26 21:08:00,227 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-26 21:08:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 1 times [2019-12-26 21:08:00,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:00,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812670144] [2019-12-26 21:08:00,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:08:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:08:00,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812670144] [2019-12-26 21:08:00,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:08:00,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:08:00,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15487194] [2019-12-26 21:08:00,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:08:00,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:08:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:08:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:08:00,311 INFO L87 Difference]: Start difference. First operand 136551 states and 539951 transitions. Second operand 6 states. [2019-12-26 21:08:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:08:06,758 INFO L93 Difference]: Finished difference Result 218575 states and 858888 transitions. [2019-12-26 21:08:06,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:08:06,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-26 21:08:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:08:07,310 INFO L225 Difference]: With dead ends: 218575 [2019-12-26 21:08:07,310 INFO L226 Difference]: Without dead ends: 201503 [2019-12-26 21:08:07,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:08:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201503 states. [2019-12-26 21:08:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201503 to 152069. [2019-12-26 21:08:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152069 states. [2019-12-26 21:08:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152069 states to 152069 states and 601534 transitions. [2019-12-26 21:08:12,794 INFO L78 Accepts]: Start accepts. Automaton has 152069 states and 601534 transitions. Word has length 35 [2019-12-26 21:08:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:12,795 INFO L462 AbstractCegarLoop]: Abstraction has 152069 states and 601534 transitions. [2019-12-26 21:08:12,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:08:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 152069 states and 601534 transitions. [2019-12-26 21:08:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 21:08:13,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:13,027 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] [2019-12-26 21:08:13,027 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-26 21:08:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -22818902, now seen corresponding path program 2 times [2019-12-26 21:08:13,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:13,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185327189] [2019-12-26 21:08:13,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:08:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:08:13,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185327189] [2019-12-26 21:08:13,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:08:13,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:08:13,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411801345] [2019-12-26 21:08:13,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:08:13,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:08:13,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:08:13,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:08:13,104 INFO L87 Difference]: Start difference. First operand 152069 states and 601534 transitions. Second operand 5 states. [2019-12-26 21:08:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:08:13,268 INFO L93 Difference]: Finished difference Result 21051 states and 72404 transitions. [2019-12-26 21:08:13,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:08:13,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-26 21:08:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:08:13,295 INFO L225 Difference]: With dead ends: 21051 [2019-12-26 21:08:13,295 INFO L226 Difference]: Without dead ends: 11545 [2019-12-26 21:08:13,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:08:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11545 states. [2019-12-26 21:08:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11545 to 11509. [2019-12-26 21:08:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11509 states. [2019-12-26 21:08:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11509 states to 11509 states and 33843 transitions. [2019-12-26 21:08:13,450 INFO L78 Accepts]: Start accepts. Automaton has 11509 states and 33843 transitions. Word has length 35 [2019-12-26 21:08:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:13,450 INFO L462 AbstractCegarLoop]: Abstraction has 11509 states and 33843 transitions. [2019-12-26 21:08:13,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:08:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 11509 states and 33843 transitions. [2019-12-26 21:08:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 21:08:13,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:13,464 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] [2019-12-26 21:08:13,464 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-26 21:08:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-26 21:08:13,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:13,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400549267] [2019-12-26 21:08:13,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:08:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:08:13,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400549267] [2019-12-26 21:08:13,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:08:13,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:08:13,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327912004] [2019-12-26 21:08:13,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:08:13,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:08:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:08:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:08:13,551 INFO L87 Difference]: Start difference. First operand 11509 states and 33843 transitions. Second operand 4 states. [2019-12-26 21:08:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:08:13,615 INFO L93 Difference]: Finished difference Result 12692 states and 36561 transitions. [2019-12-26 21:08:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:08:13,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-26 21:08:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:08:13,635 INFO L225 Difference]: With dead ends: 12692 [2019-12-26 21:08:13,635 INFO L226 Difference]: Without dead ends: 11513 [2019-12-26 21:08:13,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:08:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-12-26 21:08:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 11133. [2019-12-26 21:08:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11133 states. [2019-12-26 21:08:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11133 states to 11133 states and 32986 transitions. [2019-12-26 21:08:13,789 INFO L78 Accepts]: Start accepts. Automaton has 11133 states and 32986 transitions. Word has length 47 [2019-12-26 21:08:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:13,789 INFO L462 AbstractCegarLoop]: Abstraction has 11133 states and 32986 transitions. [2019-12-26 21:08:13,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:08:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11133 states and 32986 transitions. [2019-12-26 21:08:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 21:08:13,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:13,801 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] [2019-12-26 21:08:13,802 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-26 21:08:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash -109708298, now seen corresponding path program 2 times [2019-12-26 21:08:13,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:13,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586282882] [2019-12-26 21:08:13,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:08:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:08:13,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586282882] [2019-12-26 21:08:13,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:08:13,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:08:13,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184312476] [2019-12-26 21:08:13,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:08:13,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:08:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:08:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:08:13,863 INFO L87 Difference]: Start difference. First operand 11133 states and 32986 transitions. Second operand 4 states. [2019-12-26 21:08:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:08:13,940 INFO L93 Difference]: Finished difference Result 17030 states and 47873 transitions. [2019-12-26 21:08:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:08:13,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-26 21:08:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:08:13,950 INFO L225 Difference]: With dead ends: 17030 [2019-12-26 21:08:13,950 INFO L226 Difference]: Without dead ends: 6173 [2019-12-26 21:08:13,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:08:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2019-12-26 21:08:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 6170. [2019-12-26 21:08:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-12-26 21:08:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 15504 transitions. [2019-12-26 21:08:14,064 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 15504 transitions. Word has length 47 [2019-12-26 21:08:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:14,064 INFO L462 AbstractCegarLoop]: Abstraction has 6170 states and 15504 transitions. [2019-12-26 21:08:14,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:08:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 15504 transitions. [2019-12-26 21:08:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 21:08:14,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:14,075 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] [2019-12-26 21:08:14,075 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-26 21:08:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 924019022, now seen corresponding path program 3 times [2019-12-26 21:08:14,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:14,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538482395] [2019-12-26 21:08:14,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:08:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:08:14,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538482395] [2019-12-26 21:08:14,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:08:14,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:08:14,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120744598] [2019-12-26 21:08:14,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:08:14,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:08:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:08:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:08:14,262 INFO L87 Difference]: Start difference. First operand 6170 states and 15504 transitions. Second operand 6 states. [2019-12-26 21:08:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:08:14,341 INFO L93 Difference]: Finished difference Result 4632 states and 11948 transitions. [2019-12-26 21:08:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:08:14,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-26 21:08:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:08:14,343 INFO L225 Difference]: With dead ends: 4632 [2019-12-26 21:08:14,343 INFO L226 Difference]: Without dead ends: 502 [2019-12-26 21:08:14,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:08:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-26 21:08:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-12-26 21:08:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-12-26 21:08:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1116 transitions. [2019-12-26 21:08:14,350 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1116 transitions. Word has length 47 [2019-12-26 21:08:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:14,350 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 1116 transitions. [2019-12-26 21:08:14,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:08:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1116 transitions. [2019-12-26 21:08:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:08:14,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:14,352 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] [2019-12-26 21:08:14,352 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-26 21:08:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 1 times [2019-12-26 21:08:14,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:14,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995975125] [2019-12-26 21:08:14,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:08:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:08:14,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995975125] [2019-12-26 21:08:14,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:08:14,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:08:14,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848425094] [2019-12-26 21:08:14,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:08:14,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:08:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:08:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:08:14,464 INFO L87 Difference]: Start difference. First operand 502 states and 1116 transitions. Second operand 8 states. [2019-12-26 21:08:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:08:14,708 INFO L93 Difference]: Finished difference Result 1040 states and 2253 transitions. [2019-12-26 21:08:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:08:14,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-26 21:08:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:08:14,710 INFO L225 Difference]: With dead ends: 1040 [2019-12-26 21:08:14,710 INFO L226 Difference]: Without dead ends: 789 [2019-12-26 21:08:14,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:08:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-26 21:08:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 625. [2019-12-26 21:08:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-12-26 21:08:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1348 transitions. [2019-12-26 21:08:14,724 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1348 transitions. Word has length 63 [2019-12-26 21:08:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:08:14,725 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 1348 transitions. [2019-12-26 21:08:14,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:08:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1348 transitions. [2019-12-26 21:08:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:08:14,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:08:14,727 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] [2019-12-26 21:08:14,727 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-26 21:08:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:08:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 2 times [2019-12-26 21:08:14,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:08:14,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139494254] [2019-12-26 21:08:14,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:08:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:08:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:08:14,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:08:14,964 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:08:14,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112|) |v_ULTIMATE.start_main_~#t17~0.offset_63| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= |v_ULTIMATE.start_main_~#t17~0.offset_63| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t17~0.base_112| 4)) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t17~0.base_112|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112| 1)) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_59|, ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_84|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t17~0.offset=|v_ULTIMATE.start_main_~#t17~0.offset_63|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~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_461, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~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_977, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ULTIMATE.start_main_~#t17~0.base=|v_ULTIMATE.start_main_~#t17~0.base_112|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t19~0.base, ULTIMATE.start_main_~#t18~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t17~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t18~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t19~0.offset, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t17~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:08:14,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t18~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11|) |v_ULTIMATE.start_main_~#t18~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t18~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t18~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t18~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t18~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t18~0.offset, #length] because there is no mapped edge [2019-12-26 21:08:14,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t19~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11|) |v_ULTIMATE.start_main_~#t19~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t19~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t19~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t19~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t19~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t19~0.base] because there is no mapped edge [2019-12-26 21:08:14,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_69) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_69) (= (mod v_~y$w_buff1_used~0_197 256) 0) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_69, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:08:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In117783820 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In117783820 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In117783820 |P2Thread1of1ForFork0_#t~ite28_Out117783820|)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out117783820| ~y$w_buff0~0_In117783820) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In117783820, ~y$w_buff1~0=~y$w_buff1~0_In117783820, ~y$w_buff0~0=~y$w_buff0~0_In117783820, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In117783820} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out117783820|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117783820, ~y$w_buff1~0=~y$w_buff1~0_In117783820, ~y$w_buff0~0=~y$w_buff0~0_In117783820, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In117783820} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 21:08:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-26 21:08:14,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:08:14,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-541631609 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-541631609| ~y$mem_tmp~0_In-541631609) (not .cse0)) (and (= ~y~0_In-541631609 |P2Thread1of1ForFork0_#t~ite48_Out-541631609|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-541631609, ~y$flush_delayed~0=~y$flush_delayed~0_In-541631609, ~y~0=~y~0_In-541631609} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-541631609|, ~y$mem_tmp~0=~y$mem_tmp~0_In-541631609, ~y$flush_delayed~0=~y$flush_delayed~0_In-541631609, ~y~0=~y~0_In-541631609} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-26 21:08:14,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_10|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:08:14,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In6158688 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In6158688 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out6158688| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out6158688| ~y$w_buff0_used~0_In6158688) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In6158688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In6158688} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In6158688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In6158688, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out6158688|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-26 21:08:14,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In375480780 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In375480780 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In375480780 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In375480780 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out375480780|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out375480780| ~y$w_buff1_used~0_In375480780) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In375480780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In375480780, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In375480780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In375480780} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In375480780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In375480780, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In375480780, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out375480780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In375480780} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-26 21:08:14,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In49849097 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In49849097 256)))) (or (and (= ~y$r_buff0_thd3~0_In49849097 ~y$r_buff0_thd3~0_Out49849097) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out49849097) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In49849097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In49849097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In49849097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out49849097, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out49849097|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-26 21:08:14,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1867486756 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1867486756 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1867486756 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1867486756 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In1867486756 |P2Thread1of1ForFork0_#t~ite54_Out1867486756|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1867486756|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1867486756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1867486756, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1867486756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867486756} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1867486756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1867486756, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1867486756|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1867486756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867486756} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:08:14,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:08:15,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1110279274 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1110279274| ~y$mem_tmp~0_In1110279274) (not .cse0)) (and .cse0 (= ~y~0_In1110279274 |P1Thread1of1ForFork2_#t~ite25_Out1110279274|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1110279274, ~y$flush_delayed~0=~y$flush_delayed~0_In1110279274, ~y~0=~y~0_In1110279274} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1110279274, ~y$flush_delayed~0=~y$flush_delayed~0_In1110279274, ~y~0=~y~0_In1110279274, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1110279274|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:08:15,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~y$flush_delayed~0_261 0) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_94|) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_94|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_93|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:08:15,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:08:15,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1726314110 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1726314110 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1726314110| |ULTIMATE.start_main_#t~ite58_Out-1726314110|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1726314110 |ULTIMATE.start_main_#t~ite58_Out-1726314110|) .cse2) (and (= |ULTIMATE.start_main_#t~ite58_Out-1726314110| ~y~0_In-1726314110) (or .cse0 .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1726314110, ~y~0=~y~0_In-1726314110, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1726314110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1726314110} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1726314110, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1726314110|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1726314110|, ~y~0=~y~0_In-1726314110, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1726314110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1726314110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:08:15,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1542729194 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1542729194 256)))) (or (and (= ~y$w_buff0_used~0_In-1542729194 |ULTIMATE.start_main_#t~ite60_Out-1542729194|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1542729194|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1542729194, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1542729194} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1542729194|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1542729194, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1542729194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:08:15,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-681886150 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-681886150 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-681886150 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-681886150 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-681886150| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out-681886150| ~y$w_buff1_used~0_In-681886150) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-681886150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681886150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681886150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681886150} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-681886150|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681886150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681886150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681886150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681886150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:08:15,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1520279536 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1520279536 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1520279536 |ULTIMATE.start_main_#t~ite62_Out-1520279536|)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1520279536| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1520279536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1520279536} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1520279536|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1520279536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1520279536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:08:15,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-865066407 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-865066407 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-865066407 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-865066407 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-865066407| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite63_Out-865066407| ~y$r_buff1_thd0~0_In-865066407) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-865066407, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-865066407, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-865066407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-865066407} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-865066407|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-865066407, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-865066407, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-865066407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-865066407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:08:15,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= 1 v_~__unbuffered_p0_EAX~0_29) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= v_~main$tmp_guard1~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:08:15,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:08:15 BasicIcfg [2019-12-26 21:08:15,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:08:15,159 INFO L168 Benchmark]: Toolchain (without parser) took 100096.69 ms. Allocated memory was 143.7 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,161 INFO L168 Benchmark]: CDTParser took 1.31 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.26 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 153.2 MB in the end (delta: -53.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.36 ms. Allocated memory is still 200.8 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,167 INFO L168 Benchmark]: Boogie Preprocessor took 39.79 ms. Allocated memory is still 200.8 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,167 INFO L168 Benchmark]: RCFGBuilder took 1100.22 ms. Allocated memory is still 200.8 MB. Free memory was 147.7 MB in the beginning and 92.2 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,168 INFO L168 Benchmark]: TraceAbstraction took 98091.71 ms. Allocated memory was 200.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 91.6 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 21:08:15,175 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.26 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 153.2 MB in the end (delta: -53.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.36 ms. Allocated memory is still 200.8 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.79 ms. Allocated memory is still 200.8 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1100.22 ms. Allocated memory is still 200.8 MB. Free memory was 147.7 MB in the beginning and 92.2 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98091.71 ms. Allocated memory was 200.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 91.6 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L842] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L844] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 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)) [L804] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 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)) [L805] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 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)) [L806] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 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)) [L808] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 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)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 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) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 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 [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=8, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3284 SDtfs, 3929 SDslu, 5264 SDs, 0 SdLazy, 1446 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152069occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 100331 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 51172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...