/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/safe011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:37:04,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:37:04,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:37:04,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:37:04,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:37:04,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:37:04,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:37:04,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:37:04,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:37:04,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:37:04,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:37:04,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:37:04,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:37:04,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:37:04,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:37:04,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:37:04,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:37:04,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:37:04,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:37:04,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:37:04,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:37:04,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:37:04,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:37:04,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:37:04,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:37:04,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:37:04,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:37:04,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:37:04,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:37:04,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:37:04,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:37:04,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:37:04,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:37:04,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:37:04,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:37:04,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:37:04,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:37:04,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:37:04,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:37:04,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:37:04,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:37:04,811 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 14:37:04,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:37:04,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:37:04,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:37:04,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:37:04,839 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:37:04,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:37:04,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:37:04,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:37:04,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:37:04,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:37:04,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:37:04,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:37:04,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:37:04,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:37:04,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:37:04,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:37:04,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:37:04,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:37:04,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:37:04,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:37:04,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:37:04,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:37:04,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:37:04,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:37:04,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:37:04,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:37:04,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:37:04,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:37:04,845 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:37:04,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:37:05,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:37:05,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:37:05,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:37:05,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:37:05,148 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:37:05,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2019-12-18 14:37:05,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5154ed2a/8137a4d6a69744bfbe1e1ec10495e035/FLAGba15aef13 [2019-12-18 14:37:05,785 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:37:05,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2019-12-18 14:37:05,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5154ed2a/8137a4d6a69744bfbe1e1ec10495e035/FLAGba15aef13 [2019-12-18 14:37:06,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5154ed2a/8137a4d6a69744bfbe1e1ec10495e035 [2019-12-18 14:37:06,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:37:06,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:37:06,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:37:06,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:37:06,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:37:06,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06, skipping insertion in model container [2019-12-18 14:37:06,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:37:06,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:37:06,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:37:06,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:37:06,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:37:06,836 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:37:06,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06 WrapperNode [2019-12-18 14:37:06,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:37:06,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:37:06,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:37:06,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:37:06,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:37:06,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:37:06,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:37:06,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:37:06,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (1/1) ... [2019-12-18 14:37:06,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:37:06,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:37:06,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:37:06,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:37:06,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (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 14:37:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:37:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:37:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:37:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:37:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:37:07,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:37:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:37:07,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:37:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:37:07,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:37:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:37:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:37:07,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:37:07,027 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 14:37:07,856 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:37:07,856 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:37:07,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:37:07 BoogieIcfgContainer [2019-12-18 14:37:07,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:37:07,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:37:07,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:37:07,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:37:07,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:37:06" (1/3) ... [2019-12-18 14:37:07,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73701135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:37:07, skipping insertion in model container [2019-12-18 14:37:07,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:06" (2/3) ... [2019-12-18 14:37:07,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73701135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:37:07, skipping insertion in model container [2019-12-18 14:37:07,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:37:07" (3/3) ... [2019-12-18 14:37:07,868 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.opt.i [2019-12-18 14:37:07,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:37:07,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:37:07,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:37:07,888 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:37:07,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,967 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,967 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:07,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:08,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:37:08,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:37:08,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:37:08,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:37:08,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:37:08,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:37:08,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:37:08,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:37:08,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:37:08,042 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 14:37:08,044 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:37:08,136 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:37:08,136 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:37:08,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:37:08,191 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:37:08,278 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:37:08,278 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:37:08,287 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:37:08,307 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 14:37:08,308 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:37:08,684 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-18 14:37:13,298 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 14:37:13,561 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:37:13,671 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:37:13,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87419 [2019-12-18 14:37:13,703 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 14:37:13,707 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 14:37:30,486 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 14:37:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 14:37:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:37:30,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:37:30,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:37:30,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:37:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:37:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 809706692, now seen corresponding path program 1 times [2019-12-18 14:37:30,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:37:30,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625383459] [2019-12-18 14:37:30,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:37:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:37:30,774 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 14:37:30,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625383459] [2019-12-18 14:37:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:37:30,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:37:30,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514583950] [2019-12-18 14:37:30,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:37:30,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:37:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:37:30,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:37:30,805 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 14:37:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:37:34,569 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 14:37:34,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:37:34,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:37:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:37:35,291 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 14:37:35,292 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 14:37:35,293 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 14:37:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 14:37:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 14:37:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 14:37:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 14:37:41,749 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 14:37:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:37:41,749 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 14:37:41,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:37:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 14:37:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:37:41,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:37:41,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:37:41,753 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:37:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:37:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1056800905, now seen corresponding path program 1 times [2019-12-18 14:37:41,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:37:41,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415970312] [2019-12-18 14:37:41,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:37:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:37:41,837 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 14:37:41,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415970312] [2019-12-18 14:37:41,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:37:41,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:37:41,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22674504] [2019-12-18 14:37:41,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:37:41,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:37:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:37:41,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:37:41,841 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 14:37:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:37:46,506 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 14:37:46,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:37:46,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:37:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:37:47,097 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 14:37:47,097 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 14:37:47,098 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 14:37:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 14:38:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 14:38:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 14:38:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 14:38:00,937 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 14:38:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:00,937 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 14:38:00,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:38:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 14:38:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:38:00,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:00,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:00,944 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:00,945 INFO L82 PathProgramCache]: Analyzing trace with hash 933289536, now seen corresponding path program 1 times [2019-12-18 14:38:00,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:00,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724105178] [2019-12-18 14:38:00,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:01,014 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 14:38:01,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724105178] [2019-12-18 14:38:01,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:01,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:01,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395071299] [2019-12-18 14:38:01,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:38:01,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:38:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:38:01,017 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 14:38:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:07,727 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 14:38:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:38:07,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:38:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:08,322 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 14:38:08,323 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 14:38:08,323 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 14:38:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 14:38:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 14:38:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 14:38:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 14:38:18,301 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 14:38:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:18,303 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 14:38:18,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:38:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 14:38:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:38:18,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:18,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:18,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1797085387, now seen corresponding path program 1 times [2019-12-18 14:38:18,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:18,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405201936] [2019-12-18 14:38:18,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:18,394 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 14:38:18,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405201936] [2019-12-18 14:38:18,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:18,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:18,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494653638] [2019-12-18 14:38:18,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:18,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:18,398 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 14:38:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:18,530 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 14:38:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:18,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:38:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:18,586 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 14:38:18,586 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 14:38:18,587 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 14:38:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 14:38:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 14:38:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 14:38:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 14:38:24,734 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 14:38:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:24,734 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 14:38:24,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 14:38:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:38:24,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:24,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:24,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1117796869, now seen corresponding path program 1 times [2019-12-18 14:38:24,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:24,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458050458] [2019-12-18 14:38:24,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:24,859 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 14:38:24,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458050458] [2019-12-18 14:38:24,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:24,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:24,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974137334] [2019-12-18 14:38:24,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:24,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:24,862 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 14:38:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:25,666 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 14:38:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:38:25,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:38:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:25,746 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 14:38:25,747 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 14:38:25,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:38:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 14:38:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 14:38:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 14:38:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 14:38:26,604 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 14:38:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:26,605 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 14:38:26,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 14:38:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:38:26,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:26,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:26,617 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash 7812214, now seen corresponding path program 1 times [2019-12-18 14:38:26,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:26,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427196667] [2019-12-18 14:38:26,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:26,684 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 14:38:26,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427196667] [2019-12-18 14:38:26,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:26,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:26,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433280401] [2019-12-18 14:38:26,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:38:26,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:38:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:38:26,686 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 14:38:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:27,085 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 14:38:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:38:27,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:38:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:27,099 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 14:38:27,099 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 14:38:27,100 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 14:38:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 14:38:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 14:38:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 14:38:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 14:38:27,239 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 14:38:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:27,240 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 14:38:27,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:38:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 14:38:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:38:27,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:27,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:27,252 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1437682904, now seen corresponding path program 1 times [2019-12-18 14:38:27,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:27,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332709849] [2019-12-18 14:38:27,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:27,380 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 14:38:27,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332709849] [2019-12-18 14:38:27,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:27,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:38:27,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608250981] [2019-12-18 14:38:27,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:27,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:27,382 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 14:38:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:27,423 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 14:38:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:38:27,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:38:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:27,432 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 14:38:27,433 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 14:38:27,433 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 14:38:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 14:38:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 14:38:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 14:38:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 14:38:27,513 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 14:38:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:27,514 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 14:38:27,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 14:38:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:27,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:27,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:27,525 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2059462380, now seen corresponding path program 1 times [2019-12-18 14:38:27,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:27,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481127787] [2019-12-18 14:38:27,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:27,597 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 14:38:27,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481127787] [2019-12-18 14:38:27,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:27,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:27,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374775576] [2019-12-18 14:38:27,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:27,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:27,600 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:38:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:27,657 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 14:38:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:27,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:38:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:27,665 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:38:27,666 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:38:27,666 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 14:38:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:38:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:38:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:38:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 14:38:27,730 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 14:38:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:27,730 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 14:38:27,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 14:38:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:27,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:27,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:27,738 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash -151073877, now seen corresponding path program 1 times [2019-12-18 14:38:27,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:27,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981909424] [2019-12-18 14:38:27,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:27,813 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 14:38:27,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981909424] [2019-12-18 14:38:27,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:27,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:27,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047101952] [2019-12-18 14:38:27,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:27,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:27,816 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 14:38:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:27,867 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 14:38:27,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:27,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:38:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:27,876 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:38:27,876 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:38:27,876 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 14:38:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:38:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:38:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:38:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 14:38:27,958 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 14:38:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:27,959 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 14:38:27,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 14:38:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:27,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:27,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:27,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash -160756913, now seen corresponding path program 1 times [2019-12-18 14:38:27,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:27,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144583480] [2019-12-18 14:38:27,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:28,088 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 14:38:28,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144583480] [2019-12-18 14:38:28,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:28,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:38:28,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970074939] [2019-12-18 14:38:28,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:28,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:28,092 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 5 states. [2019-12-18 14:38:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:28,427 INFO L93 Difference]: Finished difference Result 7415 states and 21062 transitions. [2019-12-18 14:38:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:38:28,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:38:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:28,437 INFO L225 Difference]: With dead ends: 7415 [2019-12-18 14:38:28,437 INFO L226 Difference]: Without dead ends: 7415 [2019-12-18 14:38:28,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:38:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-12-18 14:38:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 5421. [2019-12-18 14:38:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-18 14:38:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-18 14:38:28,517 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-18 14:38:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:28,518 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-18 14:38:28,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-18 14:38:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:28,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:28,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:28,525 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash 947021199, now seen corresponding path program 2 times [2019-12-18 14:38:28,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:28,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973158223] [2019-12-18 14:38:28,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:28,646 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 14:38:28,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973158223] [2019-12-18 14:38:28,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:28,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:38:28,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199917443] [2019-12-18 14:38:28,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:38:28,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:38:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:38:28,648 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 6 states. [2019-12-18 14:38:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:29,226 INFO L93 Difference]: Finished difference Result 9148 states and 26227 transitions. [2019-12-18 14:38:29,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:38:29,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 14:38:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:29,239 INFO L225 Difference]: With dead ends: 9148 [2019-12-18 14:38:29,239 INFO L226 Difference]: Without dead ends: 9148 [2019-12-18 14:38:29,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 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 14:38:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9148 states. [2019-12-18 14:38:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9148 to 5923. [2019-12-18 14:38:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-18 14:38:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-18 14:38:29,336 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-18 14:38:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:29,336 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-18 14:38:29,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:38:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-18 14:38:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:29,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:29,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:29,345 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1073447055, now seen corresponding path program 3 times [2019-12-18 14:38:29,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:29,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970744849] [2019-12-18 14:38:29,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:29,420 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 14:38:29,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970744849] [2019-12-18 14:38:29,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:29,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:29,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117363067] [2019-12-18 14:38:29,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:29,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:29,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:29,422 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-18 14:38:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:29,447 INFO L93 Difference]: Finished difference Result 5089 states and 14464 transitions. [2019-12-18 14:38:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:29,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:38:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:29,455 INFO L225 Difference]: With dead ends: 5089 [2019-12-18 14:38:29,455 INFO L226 Difference]: Without dead ends: 5089 [2019-12-18 14:38:29,456 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 14:38:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2019-12-18 14:38:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 4949. [2019-12-18 14:38:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-18 14:38:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-18 14:38:29,523 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 65 [2019-12-18 14:38:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:29,523 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-18 14:38:29,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-18 14:38:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:38:29,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:29,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:29,530 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash -924926265, now seen corresponding path program 1 times [2019-12-18 14:38:29,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:29,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057648166] [2019-12-18 14:38:29,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:29,649 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 14:38:29,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057648166] [2019-12-18 14:38:29,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:29,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:38:29,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074324473] [2019-12-18 14:38:29,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:29,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:29,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:29,653 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 5 states. [2019-12-18 14:38:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:29,944 INFO L93 Difference]: Finished difference Result 7463 states and 21088 transitions. [2019-12-18 14:38:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:38:29,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 14:38:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:29,955 INFO L225 Difference]: With dead ends: 7463 [2019-12-18 14:38:29,955 INFO L226 Difference]: Without dead ends: 7463 [2019-12-18 14:38:29,955 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 14:38:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-12-18 14:38:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6154. [2019-12-18 14:38:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-12-18 14:38:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 17545 transitions. [2019-12-18 14:38:30,042 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 17545 transitions. Word has length 66 [2019-12-18 14:38:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:30,042 INFO L462 AbstractCegarLoop]: Abstraction has 6154 states and 17545 transitions. [2019-12-18 14:38:30,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 17545 transitions. [2019-12-18 14:38:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:38:30,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:30,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:30,051 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1368765211, now seen corresponding path program 2 times [2019-12-18 14:38:30,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:30,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386823551] [2019-12-18 14:38:30,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:30,435 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 14:38:30,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386823551] [2019-12-18 14:38:30,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:30,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:38:30,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963257317] [2019-12-18 14:38:30,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:38:30,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:30,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:38:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:38:30,437 INFO L87 Difference]: Start difference. First operand 6154 states and 17545 transitions. Second operand 9 states. [2019-12-18 14:38:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:31,337 INFO L93 Difference]: Finished difference Result 8873 states and 24903 transitions. [2019-12-18 14:38:31,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:38:31,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 14:38:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:31,349 INFO L225 Difference]: With dead ends: 8873 [2019-12-18 14:38:31,350 INFO L226 Difference]: Without dead ends: 8873 [2019-12-18 14:38:31,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:38:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-12-18 14:38:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6441. [2019-12-18 14:38:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2019-12-18 14:38:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 18335 transitions. [2019-12-18 14:38:31,446 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 18335 transitions. Word has length 66 [2019-12-18 14:38:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:31,446 INFO L462 AbstractCegarLoop]: Abstraction has 6441 states and 18335 transitions. [2019-12-18 14:38:31,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:38:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 18335 transitions. [2019-12-18 14:38:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:38:31,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:31,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:31,455 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:31,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1762090943, now seen corresponding path program 3 times [2019-12-18 14:38:31,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:31,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013144502] [2019-12-18 14:38:31,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:31,520 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 14:38:31,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013144502] [2019-12-18 14:38:31,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:31,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:31,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925946773] [2019-12-18 14:38:31,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:31,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:31,522 INFO L87 Difference]: Start difference. First operand 6441 states and 18335 transitions. Second operand 3 states. [2019-12-18 14:38:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:31,579 INFO L93 Difference]: Finished difference Result 6441 states and 18334 transitions. [2019-12-18 14:38:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:31,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:38:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:31,589 INFO L225 Difference]: With dead ends: 6441 [2019-12-18 14:38:31,589 INFO L226 Difference]: Without dead ends: 6441 [2019-12-18 14:38:31,590 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 14:38:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2019-12-18 14:38:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 3886. [2019-12-18 14:38:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-12-18 14:38:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 11243 transitions. [2019-12-18 14:38:31,685 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 11243 transitions. Word has length 66 [2019-12-18 14:38:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:31,685 INFO L462 AbstractCegarLoop]: Abstraction has 3886 states and 11243 transitions. [2019-12-18 14:38:31,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 11243 transitions. [2019-12-18 14:38:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:38:31,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:31,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:31,693 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1906146231, now seen corresponding path program 1 times [2019-12-18 14:38:31,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:31,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560611128] [2019-12-18 14:38:31,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:32,106 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 14:38:32,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560611128] [2019-12-18 14:38:32,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:32,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:38:32,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53693014] [2019-12-18 14:38:32,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:38:32,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:32,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:38:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:38:32,108 INFO L87 Difference]: Start difference. First operand 3886 states and 11243 transitions. Second operand 16 states. [2019-12-18 14:38:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:33,799 INFO L93 Difference]: Finished difference Result 10213 states and 29296 transitions. [2019-12-18 14:38:33,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:38:33,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:38:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:33,807 INFO L225 Difference]: With dead ends: 10213 [2019-12-18 14:38:33,808 INFO L226 Difference]: Without dead ends: 4488 [2019-12-18 14:38:33,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 14:38:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2019-12-18 14:38:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 3483. [2019-12-18 14:38:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3483 states. [2019-12-18 14:38:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 10033 transitions. [2019-12-18 14:38:33,863 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 10033 transitions. Word has length 67 [2019-12-18 14:38:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:33,863 INFO L462 AbstractCegarLoop]: Abstraction has 3483 states and 10033 transitions. [2019-12-18 14:38:33,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:38:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 10033 transitions. [2019-12-18 14:38:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:38:33,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:33,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:33,870 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1418245853, now seen corresponding path program 2 times [2019-12-18 14:38:33,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:33,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384423927] [2019-12-18 14:38:33,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:33,987 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 14:38:33,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384423927] [2019-12-18 14:38:33,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:33,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:38:33,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141590269] [2019-12-18 14:38:33,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:38:33,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:33,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:38:33,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:38:33,990 INFO L87 Difference]: Start difference. First operand 3483 states and 10033 transitions. Second operand 6 states. [2019-12-18 14:38:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:34,086 INFO L93 Difference]: Finished difference Result 6061 states and 17534 transitions. [2019-12-18 14:38:34,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:38:34,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 14:38:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:34,092 INFO L225 Difference]: With dead ends: 6061 [2019-12-18 14:38:34,092 INFO L226 Difference]: Without dead ends: 2666 [2019-12-18 14:38:34,093 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 14:38:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-12-18 14:38:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2222. [2019-12-18 14:38:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-12-18 14:38:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 6388 transitions. [2019-12-18 14:38:34,130 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 6388 transitions. Word has length 67 [2019-12-18 14:38:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:34,130 INFO L462 AbstractCegarLoop]: Abstraction has 2222 states and 6388 transitions. [2019-12-18 14:38:34,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:38:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 6388 transitions. [2019-12-18 14:38:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:38:34,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:34,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:34,134 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1668809625, now seen corresponding path program 3 times [2019-12-18 14:38:34,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:34,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890363945] [2019-12-18 14:38:34,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:34,188 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 14:38:34,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890363945] [2019-12-18 14:38:34,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:34,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:34,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679516211] [2019-12-18 14:38:34,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:34,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:34,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:34,190 INFO L87 Difference]: Start difference. First operand 2222 states and 6388 transitions. Second operand 3 states. [2019-12-18 14:38:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:34,205 INFO L93 Difference]: Finished difference Result 1948 states and 5386 transitions. [2019-12-18 14:38:34,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:34,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:38:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:34,208 INFO L225 Difference]: With dead ends: 1948 [2019-12-18 14:38:34,208 INFO L226 Difference]: Without dead ends: 1948 [2019-12-18 14:38:34,209 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 14:38:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-12-18 14:38:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1804. [2019-12-18 14:38:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2019-12-18 14:38:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 5006 transitions. [2019-12-18 14:38:34,250 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 5006 transitions. Word has length 67 [2019-12-18 14:38:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:34,250 INFO L462 AbstractCegarLoop]: Abstraction has 1804 states and 5006 transitions. [2019-12-18 14:38:34,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 5006 transitions. [2019-12-18 14:38:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:38:34,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:34,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:34,254 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1093105687, now seen corresponding path program 1 times [2019-12-18 14:38:34,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:34,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487970842] [2019-12-18 14:38:34,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:38:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:38:34,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:38:34,372 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:38:34,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$w_buff0_used~0_815) (= v_~x$r_buff0_thd1~0_121 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2034~0.base_21|)) (= v_~x$flush_delayed~0_33 0) (= v_~y~0_122 0) (= 0 v_~x$r_buff0_thd3~0_131) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2034~0.base_21| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2034~0.base_21|) (= 0 v_~x$r_buff1_thd3~0_199) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_200) (= v_~weak$$choice2~0_113 0) (= v_~z~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1~0_221) (= 0 v_~weak$$choice0~0_15) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x~0_181) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd2~0_212) (= 0 v_~x$w_buff1_used~0_499) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2034~0.base_21| 1)) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~x$r_buff1_thd0~0_296 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2034~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2034~0.base_21|) |v_ULTIMATE.start_main_~#t2034~0.offset_18| 0)) |v_#memory_int_15|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p2_EAX~0_22) (= 0 |v_ULTIMATE.start_main_~#t2034~0.offset_18|) (= 0 v_~x$w_buff0~0_269))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_22|, ~x$w_buff0~0=v_~x$w_buff0~0_269, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, ULTIMATE.start_main_~#t2036~0.offset=|v_ULTIMATE.start_main_~#t2036~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_46|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_131, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_33|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t2035~0.base=|v_ULTIMATE.start_main_~#t2035~0.base_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2034~0.offset=|v_ULTIMATE.start_main_~#t2034~0.offset_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_112|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ULTIMATE.start_main_~#t2034~0.base=|v_ULTIMATE.start_main_~#t2034~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_181, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_22|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_32|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_118|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_18|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_26|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~y~0=v_~y~0_122, ULTIMATE.start_main_~#t2035~0.offset=|v_ULTIMATE.start_main_~#t2035~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t2036~0.base=|v_ULTIMATE.start_main_~#t2036~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_60|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_815, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2036~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2035~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2034~0.offset, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2034~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t2035~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2036~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:38:34,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2035~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2035~0.base_13|) |v_ULTIMATE.start_main_~#t2035~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2035~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2035~0.base_13| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2035~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2035~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2035~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2035~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2035~0.offset=|v_ULTIMATE.start_main_~#t2035~0.offset_11|, ULTIMATE.start_main_~#t2035~0.base=|v_ULTIMATE.start_main_~#t2035~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2035~0.offset, ULTIMATE.start_main_~#t2035~0.base] because there is no mapped edge [2019-12-18 14:38:34,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= 2 v_~x$w_buff0~0_30) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= v_~x$w_buff0~0_31 v_~x$w_buff1~0_21) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_30, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:38:34,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2036~0.base_9|) (= |v_ULTIMATE.start_main_~#t2036~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2036~0.base_9|) 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2036~0.base_9| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2036~0.base_9| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2036~0.base_9| 4) |v_#length_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2036~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2036~0.base_9|) |v_ULTIMATE.start_main_~#t2036~0.offset_8| 2)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2036~0.base=|v_ULTIMATE.start_main_~#t2036~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2036~0.offset=|v_ULTIMATE.start_main_~#t2036~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2036~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2036~0.offset, #length] because there is no mapped edge [2019-12-18 14:38:34,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1702147341 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1702147341 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-1702147341| ~x$w_buff1~0_In-1702147341) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In-1702147341 |P2Thread1of1ForFork2_#t~ite15_Out-1702147341|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1702147341, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1702147341, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1702147341, ~x~0=~x~0_In-1702147341} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1702147341|, ~x$w_buff1~0=~x$w_buff1~0_In-1702147341, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1702147341, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1702147341, ~x~0=~x~0_In-1702147341} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:38:34,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 14:38:34,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-494969924 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-494969924 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-494969924|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-494969924 |P2Thread1of1ForFork2_#t~ite17_Out-494969924|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-494969924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-494969924} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-494969924, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-494969924|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-494969924} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:38:34,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1114226199 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1114226199 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1114226199 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1114226199 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1114226199 |P2Thread1of1ForFork2_#t~ite18_Out1114226199|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1114226199|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1114226199, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1114226199, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1114226199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1114226199} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1114226199, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1114226199, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1114226199, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1114226199|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1114226199} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:38:34,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In2300694 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2300694 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out2300694| ~x$r_buff0_thd3~0_In2300694) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out2300694| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2300694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2300694} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2300694, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2300694|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2300694} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:38:34,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1733900643 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1733900643 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1733900643 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1733900643 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1733900643| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite20_Out1733900643| ~x$r_buff1_thd3~0_In1733900643)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1733900643, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1733900643, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1733900643, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733900643} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1733900643|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733900643, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1733900643, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1733900643, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733900643} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:38:34,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_56| v_~x$r_buff1_thd3~0_147) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_55|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:38:34,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1813699158 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1813699158| |P0Thread1of1ForFork0_#t~ite4_Out1813699158|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1813699158 256)))) (or (and (= ~x~0_In1813699158 |P0Thread1of1ForFork0_#t~ite3_Out1813699158|) .cse0 (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out1813699158| ~x$w_buff1~0_In1813699158) (not .cse2) .cse0 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1813699158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1813699158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1813699158, ~x~0=~x~0_In1813699158} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1813699158|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1813699158|, ~x$w_buff1~0=~x$w_buff1~0_In1813699158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1813699158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1813699158, ~x~0=~x~0_In1813699158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:38:34,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1220036224 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1220036224 256) 0))) (or (and (= ~x$w_buff0_used~0_In1220036224 |P0Thread1of1ForFork0_#t~ite5_Out1220036224|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1220036224| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1220036224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1220036224} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1220036224|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1220036224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1220036224} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:38:34,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1361316687 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1361316687 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1361316687 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1361316687 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1361316687| ~x$w_buff1_used~0_In-1361316687) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1361316687|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1361316687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1361316687, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1361316687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1361316687} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1361316687|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1361316687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1361316687, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1361316687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1361316687} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:38:34,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1842073184 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1842073184 256)))) (or (and (= ~x$r_buff0_thd1~0_In-1842073184 |P0Thread1of1ForFork0_#t~ite7_Out-1842073184|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1842073184|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1842073184, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1842073184} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1842073184, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1842073184|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1842073184} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:38:34,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In924143831 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In924143831 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In924143831 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In924143831 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In924143831 |P0Thread1of1ForFork0_#t~ite8_Out924143831|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out924143831| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In924143831, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924143831, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In924143831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924143831} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In924143831, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out924143831|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924143831, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In924143831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924143831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:38:34,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_126 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 14:38:34,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-728530023 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-728530023 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-728530023 |P1Thread1of1ForFork1_#t~ite11_Out-728530023|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-728530023| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-728530023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-728530023} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-728530023|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-728530023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-728530023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:38:34,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-106336059 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-106336059 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-106336059 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-106336059 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-106336059|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-106336059 |P1Thread1of1ForFork1_#t~ite12_Out-106336059|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-106336059, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-106336059, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-106336059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-106336059} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-106336059, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-106336059, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-106336059|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-106336059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-106336059} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:38:34,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-790226901 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-790226901 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-790226901) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-790226901 ~x$r_buff0_thd2~0_Out-790226901)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-790226901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-790226901} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-790226901|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-790226901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-790226901} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:38:34,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1959568241 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1959568241 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1959568241 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1959568241 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1959568241|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1959568241| ~x$r_buff1_thd2~0_In1959568241) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1959568241, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1959568241, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1959568241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1959568241} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1959568241, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1959568241, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1959568241, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1959568241|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1959568241} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:38:34,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:38:34,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:38:34,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In7484536 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In7484536 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out7484536| |ULTIMATE.start_main_#t~ite25_Out7484536|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In7484536 |ULTIMATE.start_main_#t~ite24_Out7484536|)) (and (or .cse2 .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out7484536| ~x~0_In7484536)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In7484536, ~x$w_buff1_used~0=~x$w_buff1_used~0_In7484536, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In7484536, ~x~0=~x~0_In7484536} OutVars{~x$w_buff1~0=~x$w_buff1~0_In7484536, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out7484536|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out7484536|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In7484536, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In7484536, ~x~0=~x~0_In7484536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:38:34,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1202125998 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1202125998 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1202125998| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1202125998 |ULTIMATE.start_main_#t~ite26_Out1202125998|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1202125998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202125998} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1202125998, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1202125998|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202125998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:38:34,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1344163849 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1344163849 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1344163849 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1344163849 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1344163849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite27_Out-1344163849| ~x$w_buff1_used~0_In-1344163849)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1344163849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1344163849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1344163849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344163849} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1344163849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1344163849, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1344163849|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1344163849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344163849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:38:34,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In132789775 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In132789775 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out132789775| 0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In132789775 |ULTIMATE.start_main_#t~ite28_Out132789775|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In132789775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In132789775} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In132789775, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out132789775|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In132789775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:38:34,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1151205360 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1151205360 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1151205360 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1151205360 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out1151205360| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out1151205360| ~x$r_buff1_thd0~0_In1151205360) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1151205360, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151205360, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1151205360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151205360} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1151205360, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1151205360|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151205360, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1151205360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151205360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:38:34,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff0_thd0~0_110) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:38:34,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_151) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_151, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:38:34,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:38:34,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:38:34 BasicIcfg [2019-12-18 14:38:34,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:38:34,487 INFO L168 Benchmark]: Toolchain (without parser) took 88418.83 ms. Allocated memory was 145.8 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,487 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.33 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 157.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.42 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,489 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,490 INFO L168 Benchmark]: RCFGBuilder took 901.91 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 102.0 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,490 INFO L168 Benchmark]: TraceAbstraction took 86625.95 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 14:38:34,493 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.33 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 157.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.42 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.61 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 901.91 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 102.0 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86625.95 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 6170 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 87419 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2034, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t2035, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2036, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 86.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2663 SDtfs, 2640 SDslu, 5209 SDs, 0 SdLazy, 3868 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 30 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 76912 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 149377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...