/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/mix046_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:39:03,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:39:03,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:39:03,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:39:03,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:39:03,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:39:03,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:39:03,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:39:03,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:39:03,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:39:03,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:39:03,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:39:03,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:39:03,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:39:03,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:39:03,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:39:03,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:39:03,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:39:03,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:39:03,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:39:03,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:39:03,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:39:03,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:39:03,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:39:03,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:39:03,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:39:03,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:39:03,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:39:03,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:39:03,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:39:03,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:39:03,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:39:03,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:39:03,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:39:03,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:39:03,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:39:03,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:39:03,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:39:03,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:39:03,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:39:03,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:39:03,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:39:03,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:39:03,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:39:03,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:39:03,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:39:03,760 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:39:03,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:39:03,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:39:03,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:39:03,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:39:03,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:39:03,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:39:03,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:39:03,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:39:03,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:39:03,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:39:03,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:39:03,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:39:03,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:39:03,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:39:03,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:39:03,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:39:03,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:39:03,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:39:03,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:39:03,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:39:03,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:39:03,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:39:03,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:39:03,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:39:03,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:39:04,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:39:04,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:39:04,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:39:04,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:39:04,125 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:39:04,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-18 13:39:04,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5849a67b/f5bd0ef8e5124854a5c2dc9a78ad4ae0/FLAGd1e12df3b [2019-12-18 13:39:04,725 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:39:04,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-18 13:39:04,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5849a67b/f5bd0ef8e5124854a5c2dc9a78ad4ae0/FLAGd1e12df3b [2019-12-18 13:39:05,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5849a67b/f5bd0ef8e5124854a5c2dc9a78ad4ae0 [2019-12-18 13:39:05,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:39:05,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:39:05,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:39:05,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:39:05,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:39:05,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:05,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163f1a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05, skipping insertion in model container [2019-12-18 13:39:05,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:05,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:39:05,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:39:05,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:39:05,765 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:39:05,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:39:05,934 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:39:05,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05 WrapperNode [2019-12-18 13:39:05,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:39:05,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:39:05,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:39:05,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:39:05,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:05,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:39:06,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:39:06,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:39:06,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:39:06,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... [2019-12-18 13:39:06,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:39:06,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:39:06,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:39:06,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:39:06,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:39:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:39:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:39:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:39:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:39:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:39:06,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:39:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:39:06,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:39:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:39:06,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:39:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:39:06,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:39:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:39:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:39:06,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:39:06,131 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:39:06,885 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:39:06,885 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:39:06,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:39:06 BoogieIcfgContainer [2019-12-18 13:39:06,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:39:06,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:39:06,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:39:06,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:39:06,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:39:05" (1/3) ... [2019-12-18 13:39:06,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f4bedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:39:06, skipping insertion in model container [2019-12-18 13:39:06,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:05" (2/3) ... [2019-12-18 13:39:06,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f4bedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:39:06, skipping insertion in model container [2019-12-18 13:39:06,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:39:06" (3/3) ... [2019-12-18 13:39:06,896 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i [2019-12-18 13:39:06,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:39:06,907 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:39:06,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:39:06,916 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:39:06,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,968 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,987 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,991 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,992 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,992 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,992 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,992 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,992 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,994 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:06,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:07,010 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:39:07,034 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:39:07,035 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:39:07,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:39:07,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:39:07,035 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:39:07,035 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:39:07,036 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:39:07,036 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:39:07,073 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 13:39:07,075 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:39:07,184 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:39:07,184 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:39:07,202 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:39:07,227 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:39:07,292 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:39:07,292 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:39:07,299 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:39:07,315 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:39:07,316 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:39:12,425 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:39:12,556 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:39:12,580 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 13:39:12,580 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 13:39:12,583 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:39:15,577 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 13:39:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 13:39:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:39:15,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:15,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:15,587 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:15,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 13:39:15,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:15,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118023929] [2019-12-18 13:39:15,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:15,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118023929] [2019-12-18 13:39:15,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:15,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:39:15,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587091059] [2019-12-18 13:39:15,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:15,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:15,935 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 13:39:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:16,727 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 13:39:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:16,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:39:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:17,067 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 13:39:17,067 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 13:39:17,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 13:39:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 13:39:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 13:39:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 13:39:19,882 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 13:39:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:19,884 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 13:39:19,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 13:39:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:39:19,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:19,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:19,892 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 13:39:19,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:19,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419454547] [2019-12-18 13:39:19,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:20,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419454547] [2019-12-18 13:39:20,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:20,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:20,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386532233] [2019-12-18 13:39:20,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:39:20,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:39:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:39:20,014 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 13:39:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:22,272 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 13:39:22,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:39:22,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:39:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:22,583 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 13:39:22,584 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 13:39:22,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:39:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 13:39:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 13:39:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 13:39:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 13:39:24,792 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 13:39:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:24,792 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 13:39:24,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:39:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 13:39:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:39:24,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:24,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:24,796 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 13:39:24,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:24,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671994706] [2019-12-18 13:39:24,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:24,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-18 13:39:24,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671994706] [2019-12-18 13:39:24,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:24,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:24,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143627276] [2019-12-18 13:39:24,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:24,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:24,863 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 13:39:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:25,037 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 13:39:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:25,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:39:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:25,159 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 13:39:25,160 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 13:39:25,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 13:39:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 13:39:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 13:39:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 13:39:28,392 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 13:39:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:28,392 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 13:39:28,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 13:39:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:39:28,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:28,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:28,396 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 13:39:28,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:28,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190209855] [2019-12-18 13:39:28,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:28,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190209855] [2019-12-18 13:39:28,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:28,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:39:28,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466648646] [2019-12-18 13:39:28,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:39:28,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:39:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:39:28,459 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 13:39:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:28,530 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 13:39:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:39:28,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:39:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:28,561 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 13:39:28,562 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 13:39:28,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:39:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 13:39:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 13:39:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 13:39:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 13:39:29,223 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 13:39:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:29,223 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 13:39:29,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:39:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 13:39:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:39:29,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:29,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:29,225 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:29,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 13:39:29,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:29,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896796316] [2019-12-18 13:39:29,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:29,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896796316] [2019-12-18 13:39:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:29,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:39:29,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962939944] [2019-12-18 13:39:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:39:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:29,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:39:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:39:29,333 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 13:39:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:29,384 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 13:39:29,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:39:29,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:39:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:29,389 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 13:39:29,389 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 13:39:29,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:39:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 13:39:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 13:39:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 13:39:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 13:39:29,432 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 13:39:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:29,433 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 13:39:29,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:39:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 13:39:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:39:29,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:29,437 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] [2019-12-18 13:39:29,438 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 13:39:29,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:29,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056840767] [2019-12-18 13:39:29,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:29,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056840767] [2019-12-18 13:39:29,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:29,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:39:29,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592567962] [2019-12-18 13:39:29,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:39:29,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:39:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:29,516 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 13:39:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:29,567 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 13:39:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:39:29,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:39:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:29,570 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 13:39:29,570 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 13:39:29,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 13:39:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 13:39:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 13:39:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 13:39:29,584 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 13:39:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:29,584 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 13:39:29,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:39:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 13:39:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:39:29,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:29,589 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] [2019-12-18 13:39:29,589 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:29,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 13:39:29,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:29,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680033119] [2019-12-18 13:39:29,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:29,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680033119] [2019-12-18 13:39:29,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:29,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:39:29,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865415921] [2019-12-18 13:39:29,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:29,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:29,719 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 13:39:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:29,775 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 13:39:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:29,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:39:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:29,779 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:39:29,779 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:39:29,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:39:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 13:39:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 13:39:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 13:39:29,801 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 13:39:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:29,803 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 13:39:29,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 13:39:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:39:29,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:29,808 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] [2019-12-18 13:39:29,809 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 13:39:29,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:29,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760539180] [2019-12-18 13:39:29,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:29,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760539180] [2019-12-18 13:39:29,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:29,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:39:29,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425708297] [2019-12-18 13:39:29,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:29,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:29,896 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 13:39:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:29,953 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 13:39:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:29,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:39:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:29,956 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:39:29,957 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:39:29,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:39:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 13:39:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 13:39:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 13:39:29,980 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 13:39:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:29,983 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 13:39:29,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 13:39:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:39:29,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:29,989 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] [2019-12-18 13:39:29,990 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 13:39:29,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:29,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829578827] [2019-12-18 13:39:29,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:30,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829578827] [2019-12-18 13:39:30,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:30,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:39:30,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662573620] [2019-12-18 13:39:30,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:39:30,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:39:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:39:30,158 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 13:39:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:30,387 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 13:39:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:39:30,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:39:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:30,392 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 13:39:30,392 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 13:39:30,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 13:39:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 13:39:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 13:39:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 13:39:30,418 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 13:39:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:30,419 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 13:39:30,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:39:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 13:39:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:39:30,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:30,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:30,423 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 13:39:30,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:30,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823214844] [2019-12-18 13:39:30,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:30,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823214844] [2019-12-18 13:39:30,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:30,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:39:30,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055526389] [2019-12-18 13:39:30,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:39:30,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:39:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:30,533 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 13:39:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:30,901 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 13:39:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:39:30,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:39:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:30,908 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 13:39:30,909 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 13:39:30,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:39:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 13:39:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 13:39:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 13:39:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 13:39:30,939 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 13:39:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:30,940 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 13:39:30,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:39:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 13:39:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:39:30,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:30,943 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] [2019-12-18 13:39:30,944 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 13:39:30,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:30,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934005244] [2019-12-18 13:39:30,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:31,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934005244] [2019-12-18 13:39:31,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:31,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:39:31,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597061509] [2019-12-18 13:39:31,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:39:31,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:39:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:31,081 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-18 13:39:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:31,434 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-18 13:39:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:39:31,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:39:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:31,439 INFO L225 Difference]: With dead ends: 2377 [2019-12-18 13:39:31,439 INFO L226 Difference]: Without dead ends: 2377 [2019-12-18 13:39:31,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:39:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-18 13:39:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-18 13:39:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-18 13:39:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-18 13:39:31,672 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-18 13:39:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:31,673 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-18 13:39:31,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:39:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-18 13:39:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:39:31,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:31,677 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] [2019-12-18 13:39:31,677 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:31,678 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-18 13:39:31,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:31,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550220289] [2019-12-18 13:39:31,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:31,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550220289] [2019-12-18 13:39:31,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:31,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:39:31,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374314474] [2019-12-18 13:39:31,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:39:31,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:39:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:39:31,813 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 7 states. [2019-12-18 13:39:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:32,249 INFO L93 Difference]: Finished difference Result 2634 states and 7483 transitions. [2019-12-18 13:39:32,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:39:32,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 13:39:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:32,254 INFO L225 Difference]: With dead ends: 2634 [2019-12-18 13:39:32,254 INFO L226 Difference]: Without dead ends: 2634 [2019-12-18 13:39:32,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:39:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2019-12-18 13:39:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1607. [2019-12-18 13:39:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-18 13:39:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4612 transitions. [2019-12-18 13:39:32,278 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4612 transitions. Word has length 58 [2019-12-18 13:39:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:32,278 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4612 transitions. [2019-12-18 13:39:32,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:39:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4612 transitions. [2019-12-18 13:39:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:39:32,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:32,283 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] [2019-12-18 13:39:32,283 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash 658273713, now seen corresponding path program 1 times [2019-12-18 13:39:32,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:32,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972674603] [2019-12-18 13:39:32,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:32,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972674603] [2019-12-18 13:39:32,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:32,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:32,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885835486] [2019-12-18 13:39:32,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:32,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:32,362 INFO L87 Difference]: Start difference. First operand 1607 states and 4612 transitions. Second operand 3 states. [2019-12-18 13:39:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:32,402 INFO L93 Difference]: Finished difference Result 1606 states and 4610 transitions. [2019-12-18 13:39:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:32,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:39:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:32,405 INFO L225 Difference]: With dead ends: 1606 [2019-12-18 13:39:32,405 INFO L226 Difference]: Without dead ends: 1606 [2019-12-18 13:39:32,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-18 13:39:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1081. [2019-12-18 13:39:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-18 13:39:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-18 13:39:32,427 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 59 [2019-12-18 13:39:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:32,427 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-18 13:39:32,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-18 13:39:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:39:32,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:32,430 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] [2019-12-18 13:39:32,430 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:32,431 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-18 13:39:32,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:32,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194296595] [2019-12-18 13:39:32,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:32,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194296595] [2019-12-18 13:39:32,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:32,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:32,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467816977] [2019-12-18 13:39:32,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:32,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:32,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:32,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:32,494 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 3 states. [2019-12-18 13:39:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:32,514 INFO L93 Difference]: Finished difference Result 1021 states and 2884 transitions. [2019-12-18 13:39:32,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:32,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:39:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:32,517 INFO L225 Difference]: With dead ends: 1021 [2019-12-18 13:39:32,518 INFO L226 Difference]: Without dead ends: 1021 [2019-12-18 13:39:32,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2019-12-18 13:39:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 957. [2019-12-18 13:39:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-18 13:39:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2700 transitions. [2019-12-18 13:39:32,534 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 2700 transitions. Word has length 59 [2019-12-18 13:39:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:32,535 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 2700 transitions. [2019-12-18 13:39:32,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 2700 transitions. [2019-12-18 13:39:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:32,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:32,538 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] [2019-12-18 13:39:32,538 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:32,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1391147504, now seen corresponding path program 1 times [2019-12-18 13:39:32,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:32,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761696377] [2019-12-18 13:39:32,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:32,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761696377] [2019-12-18 13:39:32,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:32,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:39:32,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035105912] [2019-12-18 13:39:32,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:39:32,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:32,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:39:32,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:32,680 INFO L87 Difference]: Start difference. First operand 957 states and 2700 transitions. Second operand 6 states. [2019-12-18 13:39:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:32,756 INFO L93 Difference]: Finished difference Result 1331 states and 3551 transitions. [2019-12-18 13:39:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:39:32,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:39:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:32,758 INFO L225 Difference]: With dead ends: 1331 [2019-12-18 13:39:32,758 INFO L226 Difference]: Without dead ends: 831 [2019-12-18 13:39:32,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:39:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-12-18 13:39:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-12-18 13:39:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-18 13:39:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 2276 transitions. [2019-12-18 13:39:32,776 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 2276 transitions. Word has length 60 [2019-12-18 13:39:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:32,777 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 2276 transitions. [2019-12-18 13:39:32,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:39:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 2276 transitions. [2019-12-18 13:39:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:32,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:32,780 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] [2019-12-18 13:39:32,780 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash 709050974, now seen corresponding path program 2 times [2019-12-18 13:39:32,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:32,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119070126] [2019-12-18 13:39:32,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:32,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119070126] [2019-12-18 13:39:32,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:32,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:39:32,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100492498] [2019-12-18 13:39:32,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:39:32,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:39:32,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:39:32,954 INFO L87 Difference]: Start difference. First operand 831 states and 2276 transitions. Second operand 7 states. [2019-12-18 13:39:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:33,099 INFO L93 Difference]: Finished difference Result 1464 states and 3730 transitions. [2019-12-18 13:39:33,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:39:33,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 13:39:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:33,101 INFO L225 Difference]: With dead ends: 1464 [2019-12-18 13:39:33,101 INFO L226 Difference]: Without dead ends: 820 [2019-12-18 13:39:33,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:39:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-18 13:39:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 605. [2019-12-18 13:39:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 13:39:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1453 transitions. [2019-12-18 13:39:33,113 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1453 transitions. Word has length 60 [2019-12-18 13:39:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:33,113 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1453 transitions. [2019-12-18 13:39:33,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:39:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1453 transitions. [2019-12-18 13:39:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:33,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:33,115 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] [2019-12-18 13:39:33,115 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443498, now seen corresponding path program 3 times [2019-12-18 13:39:33,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:33,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505117820] [2019-12-18 13:39:33,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:33,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505117820] [2019-12-18 13:39:33,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:33,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:39:33,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086415175] [2019-12-18 13:39:33,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:39:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:39:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:39:33,267 INFO L87 Difference]: Start difference. First operand 605 states and 1453 transitions. Second operand 6 states. [2019-12-18 13:39:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:33,380 INFO L93 Difference]: Finished difference Result 891 states and 2045 transitions. [2019-12-18 13:39:33,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:39:33,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:39:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:33,381 INFO L225 Difference]: With dead ends: 891 [2019-12-18 13:39:33,381 INFO L226 Difference]: Without dead ends: 261 [2019-12-18 13:39:33,382 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-18 13:39:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-18 13:39:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-18 13:39:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 13:39:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 13:39:33,388 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 60 [2019-12-18 13:39:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:33,388 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 13:39:33,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:39:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 13:39:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:33,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:33,390 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] [2019-12-18 13:39:33,390 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 4 times [2019-12-18 13:39:33,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:33,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714025784] [2019-12-18 13:39:33,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:33,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714025784] [2019-12-18 13:39:33,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:33,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:39:33,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588942938] [2019-12-18 13:39:33,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:39:33,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:39:33,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:39:33,977 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 18 states. [2019-12-18 13:39:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:35,536 INFO L93 Difference]: Finished difference Result 477 states and 817 transitions. [2019-12-18 13:39:35,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:39:35,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-12-18 13:39:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:35,537 INFO L225 Difference]: With dead ends: 477 [2019-12-18 13:39:35,537 INFO L226 Difference]: Without dead ends: 445 [2019-12-18 13:39:35,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:39:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-18 13:39:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 318. [2019-12-18 13:39:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-18 13:39:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 551 transitions. [2019-12-18 13:39:35,543 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 551 transitions. Word has length 60 [2019-12-18 13:39:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:35,543 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 551 transitions. [2019-12-18 13:39:35,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:39:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 551 transitions. [2019-12-18 13:39:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:35,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:35,544 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] [2019-12-18 13:39:35,544 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1213917214, now seen corresponding path program 5 times [2019-12-18 13:39:35,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:35,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100104396] [2019-12-18 13:39:35,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:35,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100104396] [2019-12-18 13:39:35,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:35,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:39:35,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125930177] [2019-12-18 13:39:35,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 13:39:35,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 13:39:35,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:39:35,848 INFO L87 Difference]: Start difference. First operand 318 states and 551 transitions. Second operand 15 states. [2019-12-18 13:39:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:36,568 INFO L93 Difference]: Finished difference Result 464 states and 780 transitions. [2019-12-18 13:39:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:39:36,568 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 13:39:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:36,569 INFO L225 Difference]: With dead ends: 464 [2019-12-18 13:39:36,569 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 13:39:36,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:39:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 13:39:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 337. [2019-12-18 13:39:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-18 13:39:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 585 transitions. [2019-12-18 13:39:36,575 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 585 transitions. Word has length 60 [2019-12-18 13:39:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:36,575 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 585 transitions. [2019-12-18 13:39:36,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 13:39:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 585 transitions. [2019-12-18 13:39:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:36,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:36,576 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] [2019-12-18 13:39:36,576 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1191078724, now seen corresponding path program 6 times [2019-12-18 13:39:36,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:36,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108724436] [2019-12-18 13:39:36,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:36,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108724436] [2019-12-18 13:39:36,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:36,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:39:36,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469880317] [2019-12-18 13:39:36,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:39:36,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:36,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:39:36,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:39:36,798 INFO L87 Difference]: Start difference. First operand 337 states and 585 transitions. Second operand 12 states. [2019-12-18 13:39:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:37,158 INFO L93 Difference]: Finished difference Result 439 states and 735 transitions. [2019-12-18 13:39:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:39:37,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:39:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:37,159 INFO L225 Difference]: With dead ends: 439 [2019-12-18 13:39:37,160 INFO L226 Difference]: Without dead ends: 407 [2019-12-18 13:39:37,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:39:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-18 13:39:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2019-12-18 13:39:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 13:39:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 13:39:37,164 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 13:39:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:37,165 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 13:39:37,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:39:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 13:39:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:39:37,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:37,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:37,166 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 7 times [2019-12-18 13:39:37,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:37,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379976695] [2019-12-18 13:39:37,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:39:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:39:37,270 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:39:37,271 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:39:37,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1229~0.base_19| 4)) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19|) |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0)) |v_#memory_int_25|) (= v_~b~0_102 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19| 1) |v_#valid_70|) (= |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1229~0.base_19|) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19|) 0) (= v_~z$w_buff1_used~0_620 0) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_~#t1229~0.base=|v_ULTIMATE.start_main_~#t1229~0.base_19|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ULTIMATE.start_main_~#t1229~0.offset=|v_ULTIMATE.start_main_~#t1229~0.offset_16|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_22|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_16|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1230~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1231~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1229~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1230~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1229~0.offset, ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1231~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:39:37,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1230~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1230~0.base_13| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13|) |v_ULTIMATE.start_main_~#t1230~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1230~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13| 1) |v_#valid_48|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1230~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1230~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1230~0.base, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:39:37,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1231~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12|) 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1231~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1231~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1231~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12|) |v_ULTIMATE.start_main_~#t1231~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_12|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1231~0.base, ULTIMATE.start_main_~#t1231~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 13:39:37,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1232~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12| 1) |v_#valid_39|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12|) |v_ULTIMATE.start_main_~#t1232~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1232~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_12|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 13:39:37,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:39:37,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:39:37,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:39:37,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In197114909 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In197114909 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out197114909|)) (and (= ~z$w_buff0_used~0_In197114909 |P3Thread1of1ForFork3_#t~ite11_Out197114909|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In197114909, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In197114909} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In197114909, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In197114909, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out197114909|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:39:37,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-231798371 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-231798371 256)))) (or (and (= ~z~0_In-231798371 |P2Thread1of1ForFork2_#t~ite3_Out-231798371|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-231798371| ~z$w_buff1~0_In-231798371) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-231798371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-231798371, ~z$w_buff1~0=~z$w_buff1~0_In-231798371, ~z~0=~z~0_In-231798371} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-231798371|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-231798371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-231798371, ~z$w_buff1~0=~z$w_buff1~0_In-231798371, ~z~0=~z~0_In-231798371} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:39:37,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1716209914 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1716209914 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1716209914 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1716209914 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-1716209914| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1716209914 |P3Thread1of1ForFork3_#t~ite12_Out-1716209914|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1716209914, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1716209914, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1716209914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1716209914} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1716209914, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1716209914, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1716209914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1716209914, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1716209914|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:39:37,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1295678922 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1295678922 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out1295678922) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1295678922 ~z$r_buff0_thd4~0_In1295678922)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1295678922, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1295678922} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1295678922, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1295678922, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1295678922|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:39:37,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-755452641 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-755452641 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-755452641 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-755452641 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-755452641| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out-755452641| ~z$r_buff1_thd4~0_In-755452641) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-755452641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755452641, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-755452641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755452641} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-755452641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755452641, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-755452641|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-755452641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755452641} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:39:37,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:39:37,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:39:37,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2097045446 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2097045446 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out-2097045446| ~z$w_buff0_used~0_In-2097045446) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-2097045446| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2097045446, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2097045446} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-2097045446|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2097045446, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2097045446} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:39:37,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In76306837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In76306837 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In76306837 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In76306837 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out76306837|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In76306837 |P2Thread1of1ForFork2_#t~ite6_Out76306837|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In76306837, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In76306837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76306837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76306837} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out76306837|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76306837, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In76306837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76306837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76306837} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:39:37,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1117764164 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1117764164 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1117764164| ~z$r_buff0_thd3~0_In-1117764164) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1117764164|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117764164, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1117764164} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117764164, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1117764164, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1117764164|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:39:37,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1267791693 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1267791693 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1267791693 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1267791693 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1267791693 |P2Thread1of1ForFork2_#t~ite8_Out-1267791693|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1267791693|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267791693, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1267791693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267791693, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1267791693} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267791693, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1267791693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267791693, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1267791693, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1267791693|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:39:37,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:39:37,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 13:39:37,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-529538040 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-529538040 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-529538040| ~z$w_buff1~0_In-529538040) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-529538040 |ULTIMATE.start_main_#t~ite19_Out-529538040|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-529538040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-529538040, ~z$w_buff1~0=~z$w_buff1~0_In-529538040, ~z~0=~z~0_In-529538040} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-529538040|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-529538040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-529538040, ~z$w_buff1~0=~z$w_buff1~0_In-529538040, ~z~0=~z~0_In-529538040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:39:37,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:39:37,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-212002743 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-212002743 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-212002743|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-212002743| ~z$w_buff0_used~0_In-212002743)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-212002743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-212002743} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-212002743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-212002743, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-212002743|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:39:37,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1531620184 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1531620184 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1531620184 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1531620184 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1531620184| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1531620184 |ULTIMATE.start_main_#t~ite22_Out1531620184|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1531620184, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1531620184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531620184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531620184} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1531620184, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1531620184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531620184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531620184, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1531620184|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:39:37,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1363912002 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1363912002 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1363912002 |ULTIMATE.start_main_#t~ite23_Out1363912002|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out1363912002| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1363912002, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363912002} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1363912002, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363912002, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1363912002|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:39:37,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1883440570 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1883440570 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1883440570 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1883440570 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out1883440570| 0)) (and (= |ULTIMATE.start_main_#t~ite24_Out1883440570| ~z$r_buff1_thd0~0_In1883440570) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883440570, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883440570, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1883440570, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883440570} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883440570, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883440570, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1883440570, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1883440570|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883440570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:39:37,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1691675014 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-1691675014| ~z$w_buff1_used~0_In-1691675014) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1691675014 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1691675014 256))) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-1691675014 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1691675014 256)))) (= |ULTIMATE.start_main_#t~ite39_Out-1691675014| |ULTIMATE.start_main_#t~ite40_Out-1691675014|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1691675014| ~z$w_buff1_used~0_In-1691675014) (= |ULTIMATE.start_main_#t~ite39_In-1691675014| |ULTIMATE.start_main_#t~ite39_Out-1691675014|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1691675014, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1691675014, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1691675014|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1691675014, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1691675014, ~weak$$choice2~0=~weak$$choice2~0_In-1691675014} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1691675014, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1691675014|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1691675014|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1691675014, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1691675014, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1691675014, ~weak$$choice2~0=~weak$$choice2~0_In-1691675014} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:39:37,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:39:37,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1139388057 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1139388057| ~z$r_buff1_thd0~0_In1139388057) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In1139388057| |ULTIMATE.start_main_#t~ite45_Out1139388057|)) (and (= |ULTIMATE.start_main_#t~ite45_Out1139388057| |ULTIMATE.start_main_#t~ite46_Out1139388057|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1139388057 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1139388057 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1139388057 256)) (and (= (mod ~z$r_buff1_thd0~0_In1139388057 256) 0) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out1139388057| ~z$r_buff1_thd0~0_In1139388057)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139388057, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139388057, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139388057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139388057, ~weak$$choice2~0=~weak$$choice2~0_In1139388057, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1139388057|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139388057, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139388057, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139388057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139388057, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1139388057|, ~weak$$choice2~0=~weak$$choice2~0_In1139388057, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1139388057|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:39:37,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:39:37,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:39:37,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:39:37 BasicIcfg [2019-12-18 13:39:37,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:39:37,405 INFO L168 Benchmark]: Toolchain (without parser) took 32335.21 ms. Allocated memory was 142.1 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 98.1 MB in the beginning and 690.2 MB in the end (delta: -592.1 MB). Peak memory consumption was 862.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,407 INFO L168 Benchmark]: CDTParser took 1.54 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.30 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 97.9 MB in the beginning and 152.4 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.48 ms. Allocated memory is still 199.2 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,412 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 199.2 MB. Free memory was 149.6 MB in the beginning and 146.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,413 INFO L168 Benchmark]: RCFGBuilder took 840.13 ms. Allocated memory is still 199.2 MB. Free memory was 146.7 MB in the beginning and 97.5 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,414 INFO L168 Benchmark]: TraceAbstraction took 30515.20 ms. Allocated memory was 199.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 96.8 MB in the beginning and 690.2 MB in the end (delta: -593.3 MB). Peak memory consumption was 804.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:39:37,417 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.54 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 864.30 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 97.9 MB in the beginning and 152.4 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.48 ms. Allocated memory is still 199.2 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 199.2 MB. Free memory was 149.6 MB in the beginning and 146.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.13 ms. Allocated memory is still 199.2 MB. Free memory was 146.7 MB in the beginning and 97.5 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30515.20 ms. Allocated memory was 199.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 96.8 MB in the beginning and 690.2 MB in the end (delta: -593.3 MB). Peak memory consumption was 804.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2199 SDtfs, 2396 SDslu, 5836 SDs, 0 SdLazy, 3106 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 42 SyntacticMatches, 15 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 9072 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 907 ConstructedInterpolants, 0 QuantifiedInterpolants, 201106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...