/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:47:16,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:47:16,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:47:16,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:47:16,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:47:16,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:47:16,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:47:16,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:47:16,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:47:16,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:47:16,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:47:16,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:47:16,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:47:16,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:47:16,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:47:16,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:47:16,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:47:16,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:47:16,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:47:16,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:47:16,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:47:16,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:47:16,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:47:16,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:47:16,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:47:16,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:47:16,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:47:16,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:47:16,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:47:16,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:47:16,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:47:16,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:47:16,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:47:16,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:47:16,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:47:16,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:47:16,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:47:16,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:47:16,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:47:16,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:47:16,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:47:16,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:47:16,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:47:16,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:47:16,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:47:16,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:47:16,912 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:47:16,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:47:16,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:47:16,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:47:16,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:47:16,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:47:16,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:47:16,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:47:16,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:47:16,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:47:16,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:47:16,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:47:16,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:47:16,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:47:16,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:47:16,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:47:16,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:47:16,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:47:16,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:47:16,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:47:16,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:47:16,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:47:16,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:47:16,917 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:47:16,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:47:16,918 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:47:16,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:47:17,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:47:17,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:47:17,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:47:17,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:47:17,201 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:47:17,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-27 16:47:17,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b721a187/91b892dee2f0444ca0f61d57040c6f3f/FLAG9a71e2b19 [2019-12-27 16:47:17,833 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:47:17,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-27 16:47:17,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b721a187/91b892dee2f0444ca0f61d57040c6f3f/FLAG9a71e2b19 [2019-12-27 16:47:18,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b721a187/91b892dee2f0444ca0f61d57040c6f3f [2019-12-27 16:47:18,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:47:18,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:47:18,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:47:18,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:47:18,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:47:18,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:18,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b535951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18, skipping insertion in model container [2019-12-27 16:47:18,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:18,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:47:18,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:47:18,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:47:18,783 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:47:18,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:47:18,931 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:47:18,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18 WrapperNode [2019-12-27 16:47:18,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:47:18,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:47:18,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:47:18,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:47:18,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:18,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:18,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:47:19,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:47:19,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:47:19,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:47:19,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (1/1) ... [2019-12-27 16:47:19,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:47:19,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:47:19,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:47:19,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:47:19,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (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-27 16:47:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:47:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:47:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:47:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:47:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:47:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:47:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:47:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:47:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:47:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:47:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:47:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:47:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:47:19,131 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:47:19,853 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:47:19,853 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:47:19,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:47:19 BoogieIcfgContainer [2019-12-27 16:47:19,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:47:19,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:47:19,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:47:19,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:47:19,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:47:18" (1/3) ... [2019-12-27 16:47:19,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fd6bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:47:19, skipping insertion in model container [2019-12-27 16:47:19,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:47:18" (2/3) ... [2019-12-27 16:47:19,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fd6bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:47:19, skipping insertion in model container [2019-12-27 16:47:19,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:47:19" (3/3) ... [2019-12-27 16:47:19,863 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2019-12-27 16:47:19,874 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:47:19,874 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:47:19,884 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:47:19,885 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:47:19,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,967 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,967 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,992 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,993 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:19,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:47:20,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:47:20,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:47:20,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:47:20,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:47:20,037 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:47:20,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:47:20,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:47:20,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:47:20,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:47:20,054 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 16:47:20,056 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 16:47:20,172 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 16:47:20,172 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:47:20,189 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:47:20,210 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 16:47:20,306 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 16:47:20,306 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:47:20,317 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:47:20,340 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 16:47:20,341 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:47:25,597 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 16:47:25,739 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 16:47:25,764 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82137 [2019-12-27 16:47:25,764 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 16:47:25,768 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 16:47:39,762 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102312 states. [2019-12-27 16:47:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 102312 states. [2019-12-27 16:47:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:47:39,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:39,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:47:39,770 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-27 16:47:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 830375313, now seen corresponding path program 1 times [2019-12-27 16:47:39,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:39,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757078316] [2019-12-27 16:47:39,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:40,049 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-27 16:47:40,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757078316] [2019-12-27 16:47:40,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:40,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:47:40,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122059470] [2019-12-27 16:47:40,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:40,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:40,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:47:40,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:40,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:40,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:40,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:40,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:40,094 INFO L87 Difference]: Start difference. First operand 102312 states. Second operand 3 states. [2019-12-27 16:47:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:42,962 INFO L93 Difference]: Finished difference Result 102012 states and 430324 transitions. [2019-12-27 16:47:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:42,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:47:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:43,608 INFO L225 Difference]: With dead ends: 102012 [2019-12-27 16:47:43,608 INFO L226 Difference]: Without dead ends: 99828 [2019-12-27 16:47:43,610 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-27 16:47:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99828 states. [2019-12-27 16:47:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99828 to 99828. [2019-12-27 16:47:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99828 states. [2019-12-27 16:47:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99828 states to 99828 states and 421406 transitions. [2019-12-27 16:47:53,519 INFO L78 Accepts]: Start accepts. Automaton has 99828 states and 421406 transitions. Word has length 5 [2019-12-27 16:47:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:53,519 INFO L462 AbstractCegarLoop]: Abstraction has 99828 states and 421406 transitions. [2019-12-27 16:47:53,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 99828 states and 421406 transitions. [2019-12-27 16:47:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:47:53,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:53,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:53,524 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-27 16:47:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1614971329, now seen corresponding path program 1 times [2019-12-27 16:47:53,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:53,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547082711] [2019-12-27 16:47:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:53,644 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-27 16:47:53,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547082711] [2019-12-27 16:47:53,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:53,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:53,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043756359] [2019-12-27 16:47:53,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:53,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:53,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 16:47:53,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:53,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:53,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:53,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:53,701 INFO L87 Difference]: Start difference. First operand 99828 states and 421406 transitions. Second operand 5 states. [2019-12-27 16:47:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:58,631 INFO L93 Difference]: Finished difference Result 160374 states and 648740 transitions. [2019-12-27 16:47:58,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:58,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 16:47:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:59,799 INFO L225 Difference]: With dead ends: 160374 [2019-12-27 16:47:59,799 INFO L226 Difference]: Without dead ends: 160325 [2019-12-27 16:47:59,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:48:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160325 states. [2019-12-27 16:48:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160325 to 147565. [2019-12-27 16:48:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147565 states. [2019-12-27 16:48:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147565 states to 147565 states and 602627 transitions. [2019-12-27 16:48:08,597 INFO L78 Accepts]: Start accepts. Automaton has 147565 states and 602627 transitions. Word has length 11 [2019-12-27 16:48:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:08,597 INFO L462 AbstractCegarLoop]: Abstraction has 147565 states and 602627 transitions. [2019-12-27 16:48:08,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 147565 states and 602627 transitions. [2019-12-27 16:48:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:48:08,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:08,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:08,604 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-27 16:48:08,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1756735114, now seen corresponding path program 1 times [2019-12-27 16:48:08,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:08,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266801495] [2019-12-27 16:48:08,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:08,715 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-27 16:48:08,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266801495] [2019-12-27 16:48:08,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:08,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:08,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786327375] [2019-12-27 16:48:08,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:08,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:08,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:48:08,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:08,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:08,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:08,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:08,723 INFO L87 Difference]: Start difference. First operand 147565 states and 602627 transitions. Second operand 3 states. [2019-12-27 16:48:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:13,203 INFO L93 Difference]: Finished difference Result 30660 states and 98018 transitions. [2019-12-27 16:48:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:13,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:48:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:13,265 INFO L225 Difference]: With dead ends: 30660 [2019-12-27 16:48:13,265 INFO L226 Difference]: Without dead ends: 30660 [2019-12-27 16:48:13,265 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-27 16:48:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30660 states. [2019-12-27 16:48:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30660 to 30660. [2019-12-27 16:48:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30660 states. [2019-12-27 16:48:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30660 states to 30660 states and 98018 transitions. [2019-12-27 16:48:13,861 INFO L78 Accepts]: Start accepts. Automaton has 30660 states and 98018 transitions. Word has length 13 [2019-12-27 16:48:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:13,861 INFO L462 AbstractCegarLoop]: Abstraction has 30660 states and 98018 transitions. [2019-12-27 16:48:13,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 30660 states and 98018 transitions. [2019-12-27 16:48:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:48:13,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:13,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:13,864 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-27 16:48:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash -781051858, now seen corresponding path program 1 times [2019-12-27 16:48:13,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:13,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172389470] [2019-12-27 16:48:13,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:13,955 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-27 16:48:13,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172389470] [2019-12-27 16:48:13,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:13,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:13,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359327664] [2019-12-27 16:48:13,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:13,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:13,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:48:13,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:13,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:13,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:13,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:13,961 INFO L87 Difference]: Start difference. First operand 30660 states and 98018 transitions. Second operand 4 states. [2019-12-27 16:48:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:14,377 INFO L93 Difference]: Finished difference Result 41073 states and 128391 transitions. [2019-12-27 16:48:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:14,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:48:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:14,436 INFO L225 Difference]: With dead ends: 41073 [2019-12-27 16:48:14,436 INFO L226 Difference]: Without dead ends: 41066 [2019-12-27 16:48:14,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41066 states. [2019-12-27 16:48:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41066 to 36091. [2019-12-27 16:48:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36091 states. [2019-12-27 16:48:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36091 states to 36091 states and 114542 transitions. [2019-12-27 16:48:15,275 INFO L78 Accepts]: Start accepts. Automaton has 36091 states and 114542 transitions. Word has length 13 [2019-12-27 16:48:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:15,275 INFO L462 AbstractCegarLoop]: Abstraction has 36091 states and 114542 transitions. [2019-12-27 16:48:15,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36091 states and 114542 transitions. [2019-12-27 16:48:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:48:15,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:15,279 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-27 16:48:15,279 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-27 16:48:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1241691420, now seen corresponding path program 1 times [2019-12-27 16:48:15,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:15,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304142772] [2019-12-27 16:48:15,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:15,384 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-27 16:48:15,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304142772] [2019-12-27 16:48:15,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:15,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:15,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532530713] [2019-12-27 16:48:15,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:15,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:15,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 21 transitions. [2019-12-27 16:48:15,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:15,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:15,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:15,393 INFO L87 Difference]: Start difference. First operand 36091 states and 114542 transitions. Second operand 5 states. [2019-12-27 16:48:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:16,341 INFO L93 Difference]: Finished difference Result 48600 states and 151172 transitions. [2019-12-27 16:48:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:48:16,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 16:48:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:16,408 INFO L225 Difference]: With dead ends: 48600 [2019-12-27 16:48:16,409 INFO L226 Difference]: Without dead ends: 48587 [2019-12-27 16:48:16,409 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-27 16:48:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48587 states. [2019-12-27 16:48:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48587 to 36434. [2019-12-27 16:48:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36434 states. [2019-12-27 16:48:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36434 states to 36434 states and 115508 transitions. [2019-12-27 16:48:17,053 INFO L78 Accepts]: Start accepts. Automaton has 36434 states and 115508 transitions. Word has length 19 [2019-12-27 16:48:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:17,053 INFO L462 AbstractCegarLoop]: Abstraction has 36434 states and 115508 transitions. [2019-12-27 16:48:17,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 36434 states and 115508 transitions. [2019-12-27 16:48:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:48:17,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:17,067 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-27 16:48:17,067 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-27 16:48:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1959079235, now seen corresponding path program 1 times [2019-12-27 16:48:17,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:17,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194955461] [2019-12-27 16:48:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:17,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194955461] [2019-12-27 16:48:17,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:17,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:17,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1960018912] [2019-12-27 16:48:17,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:17,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:17,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:48:17,137 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:17,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:17,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:17,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:17,138 INFO L87 Difference]: Start difference. First operand 36434 states and 115508 transitions. Second operand 4 states. [2019-12-27 16:48:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:17,177 INFO L93 Difference]: Finished difference Result 7041 states and 19099 transitions. [2019-12-27 16:48:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:48:17,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:48:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:17,188 INFO L225 Difference]: With dead ends: 7041 [2019-12-27 16:48:17,189 INFO L226 Difference]: Without dead ends: 7041 [2019-12-27 16:48:17,189 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-27 16:48:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-12-27 16:48:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6929. [2019-12-27 16:48:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6929 states. [2019-12-27 16:48:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 18779 transitions. [2019-12-27 16:48:17,295 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 18779 transitions. Word has length 25 [2019-12-27 16:48:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:17,295 INFO L462 AbstractCegarLoop]: Abstraction has 6929 states and 18779 transitions. [2019-12-27 16:48:17,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 18779 transitions. [2019-12-27 16:48:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 16:48:17,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:17,307 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-27 16:48:17,307 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-27 16:48:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1376683013, now seen corresponding path program 1 times [2019-12-27 16:48:17,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:17,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580510830] [2019-12-27 16:48:17,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:17,409 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-27 16:48:17,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580510830] [2019-12-27 16:48:17,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:17,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:48:17,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1006650098] [2019-12-27 16:48:17,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:17,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:17,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 87 transitions. [2019-12-27 16:48:17,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:17,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:17,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:17,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:17,442 INFO L87 Difference]: Start difference. First operand 6929 states and 18779 transitions. Second operand 5 states. [2019-12-27 16:48:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:17,538 INFO L93 Difference]: Finished difference Result 5022 states and 14415 transitions. [2019-12-27 16:48:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:17,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 16:48:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:17,544 INFO L225 Difference]: With dead ends: 5022 [2019-12-27 16:48:17,544 INFO L226 Difference]: Without dead ends: 5022 [2019-12-27 16:48:17,545 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-27 16:48:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2019-12-27 16:48:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4658. [2019-12-27 16:48:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-12-27 16:48:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 13431 transitions. [2019-12-27 16:48:17,608 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 13431 transitions. Word has length 37 [2019-12-27 16:48:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:17,609 INFO L462 AbstractCegarLoop]: Abstraction has 4658 states and 13431 transitions. [2019-12-27 16:48:17,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 13431 transitions. [2019-12-27 16:48:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:48:17,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:17,618 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-27 16:48:17,618 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-27 16:48:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 863082331, now seen corresponding path program 1 times [2019-12-27 16:48:17,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:17,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434718027] [2019-12-27 16:48:17,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:17,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434718027] [2019-12-27 16:48:17,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:17,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:17,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1937679743] [2019-12-27 16:48:17,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:17,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:17,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 329 transitions. [2019-12-27 16:48:17,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:17,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:48:17,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:17,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:17,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:17,857 INFO L87 Difference]: Start difference. First operand 4658 states and 13431 transitions. Second operand 4 states. [2019-12-27 16:48:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:18,015 INFO L93 Difference]: Finished difference Result 6463 states and 18134 transitions. [2019-12-27 16:48:18,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:18,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:48:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:18,023 INFO L225 Difference]: With dead ends: 6463 [2019-12-27 16:48:18,024 INFO L226 Difference]: Without dead ends: 6463 [2019-12-27 16:48:18,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6463 states. [2019-12-27 16:48:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6463 to 4406. [2019-12-27 16:48:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4406 states. [2019-12-27 16:48:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 12526 transitions. [2019-12-27 16:48:18,092 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 12526 transitions. Word has length 65 [2019-12-27 16:48:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:18,093 INFO L462 AbstractCegarLoop]: Abstraction has 4406 states and 12526 transitions. [2019-12-27 16:48:18,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 12526 transitions. [2019-12-27 16:48:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:18,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:18,100 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-27 16:48:18,100 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-27 16:48:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1730486525, now seen corresponding path program 1 times [2019-12-27 16:48:18,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:18,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252100837] [2019-12-27 16:48:18,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:18,189 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-27 16:48:18,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252100837] [2019-12-27 16:48:18,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:18,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:18,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164868665] [2019-12-27 16:48:18,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:18,216 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:18,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 241 transitions. [2019-12-27 16:48:18,340 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:18,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:48:18,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:18,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:18,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:18,352 INFO L87 Difference]: Start difference. First operand 4406 states and 12526 transitions. Second operand 3 states. [2019-12-27 16:48:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:18,379 INFO L93 Difference]: Finished difference Result 4406 states and 12334 transitions. [2019-12-27 16:48:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:18,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:48:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:18,384 INFO L225 Difference]: With dead ends: 4406 [2019-12-27 16:48:18,385 INFO L226 Difference]: Without dead ends: 4406 [2019-12-27 16:48:18,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2019-12-27 16:48:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4406. [2019-12-27 16:48:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4406 states. [2019-12-27 16:48:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 12334 transitions. [2019-12-27 16:48:18,439 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 12334 transitions. Word has length 66 [2019-12-27 16:48:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:18,440 INFO L462 AbstractCegarLoop]: Abstraction has 4406 states and 12334 transitions. [2019-12-27 16:48:18,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 12334 transitions. [2019-12-27 16:48:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:18,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:18,446 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-27 16:48:18,446 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-27 16:48:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 103334100, now seen corresponding path program 1 times [2019-12-27 16:48:18,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:18,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991096386] [2019-12-27 16:48:18,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:18,557 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-27 16:48:18,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991096386] [2019-12-27 16:48:18,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:18,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:18,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [67707446] [2019-12-27 16:48:18,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:18,637 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:18,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 254 transitions. [2019-12-27 16:48:18,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:18,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:18,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:18,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:18,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:18,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:18,754 INFO L87 Difference]: Start difference. First operand 4406 states and 12334 transitions. Second operand 3 states. [2019-12-27 16:48:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:18,799 INFO L93 Difference]: Finished difference Result 4406 states and 12333 transitions. [2019-12-27 16:48:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:18,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 16:48:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:18,805 INFO L225 Difference]: With dead ends: 4406 [2019-12-27 16:48:18,805 INFO L226 Difference]: Without dead ends: 4406 [2019-12-27 16:48:18,805 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-27 16:48:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2019-12-27 16:48:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 2981. [2019-12-27 16:48:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2981 states. [2019-12-27 16:48:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 8445 transitions. [2019-12-27 16:48:18,852 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 8445 transitions. Word has length 67 [2019-12-27 16:48:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:18,853 INFO L462 AbstractCegarLoop]: Abstraction has 2981 states and 8445 transitions. [2019-12-27 16:48:18,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 8445 transitions. [2019-12-27 16:48:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 16:48:18,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:18,857 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-27 16:48:18,858 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-27 16:48:18,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1583995874, now seen corresponding path program 1 times [2019-12-27 16:48:18,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:18,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6393434] [2019-12-27 16:48:18,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:19,307 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-27 16:48:19,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6393434] [2019-12-27 16:48:19,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:19,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 16:48:19,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919287283] [2019-12-27 16:48:19,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:19,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:19,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 255 transitions. [2019-12-27 16:48:19,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:19,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:48:19,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:48:19,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:48:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:48:19,776 INFO L87 Difference]: Start difference. First operand 2981 states and 8445 transitions. Second operand 19 states. [2019-12-27 16:48:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:24,402 INFO L93 Difference]: Finished difference Result 9070 states and 24998 transitions. [2019-12-27 16:48:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 16:48:24,403 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 16:48:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:24,415 INFO L225 Difference]: With dead ends: 9070 [2019-12-27 16:48:24,415 INFO L226 Difference]: Without dead ends: 9046 [2019-12-27 16:48:24,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1201, Invalid=4651, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 16:48:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9046 states. [2019-12-27 16:48:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9046 to 4529. [2019-12-27 16:48:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4529 states. [2019-12-27 16:48:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 12724 transitions. [2019-12-27 16:48:24,505 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 12724 transitions. Word has length 68 [2019-12-27 16:48:24,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:24,505 INFO L462 AbstractCegarLoop]: Abstraction has 4529 states and 12724 transitions. [2019-12-27 16:48:24,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:48:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 12724 transitions. [2019-12-27 16:48:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 16:48:24,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:24,512 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-27 16:48:24,513 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-27 16:48:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1734168910, now seen corresponding path program 2 times [2019-12-27 16:48:24,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:24,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583486426] [2019-12-27 16:48:24,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:24,749 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-27 16:48:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583486426] [2019-12-27 16:48:24,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:24,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:48:24,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533005327] [2019-12-27 16:48:24,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:24,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:25,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 362 transitions. [2019-12-27 16:48:25,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:25,143 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:48:25,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:48:25,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:48:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:48:25,144 INFO L87 Difference]: Start difference. First operand 4529 states and 12724 transitions. Second operand 14 states. [2019-12-27 16:48:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:26,964 INFO L93 Difference]: Finished difference Result 10043 states and 27569 transitions. [2019-12-27 16:48:26,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:48:26,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 16:48:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:26,978 INFO L225 Difference]: With dead ends: 10043 [2019-12-27 16:48:26,978 INFO L226 Difference]: Without dead ends: 10019 [2019-12-27 16:48:26,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 16:48:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2019-12-27 16:48:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 4662. [2019-12-27 16:48:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4662 states. [2019-12-27 16:48:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 13109 transitions. [2019-12-27 16:48:27,068 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 13109 transitions. Word has length 68 [2019-12-27 16:48:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:27,068 INFO L462 AbstractCegarLoop]: Abstraction has 4662 states and 13109 transitions. [2019-12-27 16:48:27,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:48:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 13109 transitions. [2019-12-27 16:48:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 16:48:27,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:27,074 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-27 16:48:27,075 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-27 16:48:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1138948950, now seen corresponding path program 3 times [2019-12-27 16:48:27,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:27,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532949845] [2019-12-27 16:48:27,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:27,433 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-27 16:48:27,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532949845] [2019-12-27 16:48:27,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:27,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 16:48:27,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009951265] [2019-12-27 16:48:27,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:27,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:27,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 281 transitions. [2019-12-27 16:48:27,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:27,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:27,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:48:27,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:48:27,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:48:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:48:27,943 INFO L87 Difference]: Start difference. First operand 4662 states and 13109 transitions. Second operand 21 states. [2019-12-27 16:48:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:32,253 INFO L93 Difference]: Finished difference Result 11917 states and 32868 transitions. [2019-12-27 16:48:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 16:48:32,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-12-27 16:48:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:32,270 INFO L225 Difference]: With dead ends: 11917 [2019-12-27 16:48:32,270 INFO L226 Difference]: Without dead ends: 11891 [2019-12-27 16:48:32,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=743, Invalid=3547, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 16:48:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-12-27 16:48:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 4627. [2019-12-27 16:48:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-12-27 16:48:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 12943 transitions. [2019-12-27 16:48:32,375 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 12943 transitions. Word has length 68 [2019-12-27 16:48:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:32,376 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 12943 transitions. [2019-12-27 16:48:32,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:48:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 12943 transitions. [2019-12-27 16:48:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 16:48:32,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:32,382 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-27 16:48:32,382 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-27 16:48:32,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:32,382 INFO L82 PathProgramCache]: Analyzing trace with hash 829115294, now seen corresponding path program 4 times [2019-12-27 16:48:32,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:32,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212123099] [2019-12-27 16:48:32,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:32,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:32,497 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:32,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t891~0.base_24| 4) |v_#length_21|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t891~0.base_24|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24|)) (= 0 v_~__unbuffered_p1_EAX~0_77) (= v_~__unbuffered_cnt~0_133 0) (= 0 |v_ULTIMATE.start_main_~#t891~0.offset_17|) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_162) (= v_~a~0_11 0) (= v_~x$r_buff1_thd0~0_242 0) (= v_~x$mem_tmp~0_19 0) (= v_~x$r_buff1_thd1~0_183 0) (= 0 v_~x$r_buff1_thd2~0_137) (= 0 v_~x$r_buff0_thd2~0_211) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24| 1)) (= v_~main$tmp_guard0~0_27 0) (= v_~x$r_buff0_thd0~0_328 0) (= v_~main$tmp_guard1~0_21 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y~0_70 0) (= 0 v_~x$r_buff0_thd3~0_142) (= 0 v_~weak$$choice2~0_94) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x$w_buff0~0_417) (= v_~x$r_buff0_thd1~0_166 0) (= v_~x$flush_delayed~0_36 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$r_buff1_thd3~0_132) (= 0 v_~x$read_delayed_var~0.offset_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24|) |v_ULTIMATE.start_main_~#t891~0.offset_17| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1_used~0_523) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_19 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~z~0_71 0) (= 0 v_~__unbuffered_p2_EAX~0_20) (= v_~__unbuffered_p1_EBX~0_78 0) (= 0 v_~x$w_buff1~0_278) (= 0 v_~x$w_buff0_used~0_807))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_19|, ~x$w_buff0~0=v_~x$w_buff0~0_417, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_39|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_33|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_142, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_27|, ~a~0=v_~a~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_77, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|, ~x$w_buff1~0=v_~x$w_buff1~0_278, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_523, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_137, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_77|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_142|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_162, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_166, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_19|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_18|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_29|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_132, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_109|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_20|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_86|, ULTIMATE.start_main_~#t891~0.offset=|v_ULTIMATE.start_main_~#t891~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_78, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_~#t891~0.base=|v_ULTIMATE.start_main_~#t891~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_242, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_43|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_14|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_84|, ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_20|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ~b~0=v_~b~0_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_71, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~x$read_delayed~0=v_~x$read_delayed~0_8} 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, #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, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~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_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_~#t893~0.base, 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_~#t891~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t891~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, ULTIMATE.start_main_~#t893~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t892~0.base, ~x$read_delayed_var~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t892~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 16:48:32,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L827-1-->L829: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10|) |v_ULTIMATE.start_main_~#t892~0.offset_10| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t892~0.base_10| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t892~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t892~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t892~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t892~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t892~0.offset] because there is no mapped edge [2019-12-27 16:48:32,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L829-1-->L831: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t893~0.base_12| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12|) |v_ULTIMATE.start_main_~#t893~0.offset_10| 2))) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t893~0.base_12|) (= |v_ULTIMATE.start_main_~#t893~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t893~0.base_12|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t893~0.offset] because there is no mapped edge [2019-12-27 16:48:32,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L4-->L778: Formula: (and (not (= 0 P1Thread1of1ForFork2___VERIFIER_assert_~expression_In1026577810)) (= ~x$r_buff0_thd2~0_Out1026577810 1) (= ~y~0_Out1026577810 1) (= ~x$r_buff1_thd1~0_Out1026577810 ~x$r_buff0_thd1~0_In1026577810) (= ~z~0_In1026577810 ~__unbuffered_p1_EBX~0_Out1026577810) (= ~x$r_buff1_thd2~0_Out1026577810 ~x$r_buff0_thd2~0_In1026577810) (= ~y~0_Out1026577810 ~__unbuffered_p1_EAX~0_Out1026577810) (= ~x$r_buff0_thd3~0_In1026577810 ~x$r_buff1_thd3~0_Out1026577810) (= ~x$r_buff1_thd0~0_Out1026577810 ~x$r_buff0_thd0~0_In1026577810)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1026577810, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In1026577810, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1026577810, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1026577810, ~z~0=~z~0_In1026577810, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1026577810} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1026577810, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1026577810, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1026577810, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out1026577810, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1026577810, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1026577810, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1026577810, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1026577810, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1026577810, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In1026577810, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1026577810, ~z~0=~z~0_In1026577810, ~y~0=~y~0_Out1026577810} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~y~0] because there is no mapped edge [2019-12-27 16:48:32,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1043746944 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1043746944 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1043746944 |P1Thread1of1ForFork2_#t~ite11_Out1043746944|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1043746944|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1043746944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1043746944} OutVars{P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1043746944|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1043746944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1043746944} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:48:32,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L804-2-->L804-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In2063698513 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In2063698513 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite15_Out2063698513| ~x~0_In2063698513) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite15_Out2063698513| ~x$w_buff1~0_In2063698513) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2063698513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2063698513, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2063698513, ~x~0=~x~0_In2063698513} OutVars{P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out2063698513|, ~x$w_buff1~0=~x$w_buff1~0_In2063698513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2063698513, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2063698513, ~x~0=~x~0_In2063698513} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 16:48:32,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L804-4-->L805: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork0_#t~ite15_8|) InVars {P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_8|} OutVars{P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_7|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 16:48:32,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1033262018 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1033262018 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite17_Out-1033262018| ~x$w_buff0_used~0_In-1033262018)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite17_Out-1033262018| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1033262018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033262018} OutVars{P2Thread1of1ForFork0_#t~ite17=|P2Thread1of1ForFork0_#t~ite17_Out-1033262018|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1033262018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033262018} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-27 16:48:32,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In759215712 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In759215712 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In759215712 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In759215712 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite18_Out759215712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In759215712 |P2Thread1of1ForFork0_#t~ite18_Out759215712|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In759215712, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In759215712, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In759215712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In759215712} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In759215712, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In759215712, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In759215712, P2Thread1of1ForFork0_#t~ite18=|P2Thread1of1ForFork0_#t~ite18_Out759215712|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In759215712} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite18] because there is no mapped edge [2019-12-27 16:48:32,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1633351195 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1633351195 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite19_Out1633351195| ~x$r_buff0_thd3~0_In1633351195) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite19_Out1633351195|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1633351195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1633351195} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1633351195, P2Thread1of1ForFork0_#t~ite19=|P2Thread1of1ForFork0_#t~ite19_Out1633351195|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1633351195} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 16:48:32,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1452219937 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1452219937 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1452219937 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1452219937 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite20_Out1452219937|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In1452219937 |P2Thread1of1ForFork0_#t~ite20_Out1452219937|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1452219937, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1452219937, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1452219937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452219937} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1452219937, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1452219937, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1452219937, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1452219937|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452219937} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:48:32,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~x$r_buff1_thd3~0_64 |v_P2Thread1of1ForFork0_#t~ite20_36|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_36|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_35|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:48:32,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L743-2-->L743-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork1_#t~ite3_Out-759405025| |P0Thread1of1ForFork1_#t~ite4_Out-759405025|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-759405025 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-759405025 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P0Thread1of1ForFork1_#t~ite3_Out-759405025| ~x$w_buff1~0_In-759405025)) (and (= |P0Thread1of1ForFork1_#t~ite3_Out-759405025| ~x~0_In-759405025) .cse1 (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-759405025, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-759405025, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-759405025, ~x~0=~x~0_In-759405025} OutVars{P0Thread1of1ForFork1_#t~ite4=|P0Thread1of1ForFork1_#t~ite4_Out-759405025|, P0Thread1of1ForFork1_#t~ite3=|P0Thread1of1ForFork1_#t~ite3_Out-759405025|, ~x$w_buff1~0=~x$w_buff1~0_In-759405025, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-759405025, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-759405025, ~x~0=~x~0_In-759405025} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 16:48:32,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-832937402 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-832937402 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-832937402 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-832937402 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-832937402| ~x$w_buff1_used~0_In-832937402) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-832937402| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-832937402, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-832937402, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-832937402, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-832937402} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-832937402, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-832937402, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-832937402|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-832937402, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-832937402} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:48:32,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L781-->L782: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-25335852 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-25335852 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-25335852 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-25335852 ~x$r_buff0_thd2~0_In-25335852) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-25335852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-25335852} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-25335852, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-25335852|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-25335852} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:48:32,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In734240590 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In734240590 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In734240590 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In734240590 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In734240590 |P1Thread1of1ForFork2_#t~ite14_Out734240590|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out734240590|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In734240590, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In734240590, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In734240590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734240590} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In734240590, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In734240590, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out734240590|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In734240590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734240590} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:48:32,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L782-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork2_#t~ite14_42|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_42|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_41|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:48:32,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1824384880 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1824384880 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1824384880 |P0Thread1of1ForFork1_#t~ite5_Out-1824384880|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1824384880|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1824384880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1824384880} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1824384880|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1824384880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1824384880} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:48:32,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L745-->L745-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-1721830167 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1721830167 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1721830167 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1721830167 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1721830167| ~x$w_buff1_used~0_In-1721830167) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1721830167| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1721830167, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1721830167, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1721830167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1721830167} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1721830167, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1721830167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1721830167, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1721830167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1721830167} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:48:32,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1831039541 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1831039541 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite7_Out1831039541|) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite7_Out1831039541| ~x$r_buff0_thd1~0_In1831039541) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1831039541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1831039541} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1831039541, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1831039541|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1831039541} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 16:48:32,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L747-->L747-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-828486067 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-828486067 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-828486067 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-828486067 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-828486067| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-828486067| ~x$r_buff1_thd1~0_In-828486067) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-828486067, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-828486067, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-828486067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-828486067} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-828486067, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-828486067|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-828486067, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-828486067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-828486067} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:48:32,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L747-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 16:48:32,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L831-1-->L837: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:48:32,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L837-2-->L837-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite25_Out-990919038| |ULTIMATE.start_main_#t~ite24_Out-990919038|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-990919038 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-990919038 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-990919038 |ULTIMATE.start_main_#t~ite24_Out-990919038|)) (and (= ~x~0_In-990919038 |ULTIMATE.start_main_#t~ite24_Out-990919038|) .cse1 (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-990919038, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-990919038, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-990919038, ~x~0=~x~0_In-990919038} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-990919038, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-990919038|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-990919038|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-990919038, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-990919038, ~x~0=~x~0_In-990919038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 16:48:32,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In110876113 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In110876113 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out110876113| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite26_Out110876113| ~x$w_buff0_used~0_In110876113)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110876113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110876113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110876113, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out110876113|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110876113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 16:48:32,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-134444832 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-134444832 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-134444832 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-134444832 256)))) (or (and (= ~x$w_buff1_used~0_In-134444832 |ULTIMATE.start_main_#t~ite27_Out-134444832|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-134444832|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-134444832, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134444832, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-134444832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-134444832} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-134444832, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134444832, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-134444832|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-134444832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-134444832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 16:48:32,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L840-->L840-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1020846566 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1020846566 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1020846566| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1020846566| ~x$r_buff0_thd0~0_In1020846566)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1020846566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1020846566} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1020846566, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1020846566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1020846566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 16:48:32,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-694074010 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-694074010 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-694074010 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-694074010 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-694074010 |ULTIMATE.start_main_#t~ite29_Out-694074010|)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-694074010|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-694074010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-694074010, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-694074010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-694074010} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-694074010, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-694074010|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-694074010, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-694074010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-694074010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 16:48:32,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L849-->L849-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-448168881 256)))) (or (and .cse0 (= ~x$w_buff0~0_In-448168881 |ULTIMATE.start_main_#t~ite35_Out-448168881|) (= |ULTIMATE.start_main_#t~ite36_Out-448168881| |ULTIMATE.start_main_#t~ite35_Out-448168881|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-448168881 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-448168881 256))) (and (= (mod ~x$w_buff1_used~0_In-448168881 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-448168881 256))))) (and (= |ULTIMATE.start_main_#t~ite35_In-448168881| |ULTIMATE.start_main_#t~ite35_Out-448168881|) (not .cse0) (= ~x$w_buff0~0_In-448168881 |ULTIMATE.start_main_#t~ite36_Out-448168881|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-448168881, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-448168881, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-448168881|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-448168881, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-448168881, ~weak$$choice2~0=~weak$$choice2~0_In-448168881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-448168881} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-448168881, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-448168881, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-448168881|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-448168881|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-448168881, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-448168881, ~weak$$choice2~0=~weak$$choice2~0_In-448168881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-448168881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 16:48:32,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1399591859 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1399591859| ~x$w_buff1~0_In1399591859) (= |ULTIMATE.start_main_#t~ite38_Out1399591859| |ULTIMATE.start_main_#t~ite39_Out1399591859|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1399591859 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1399591859 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1399591859 256))) (= 0 (mod ~x$w_buff0_used~0_In1399591859 256))))) (and (= |ULTIMATE.start_main_#t~ite38_In1399591859| |ULTIMATE.start_main_#t~ite38_Out1399591859|) (= ~x$w_buff1~0_In1399591859 |ULTIMATE.start_main_#t~ite39_Out1399591859|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1399591859, ~x$w_buff1~0=~x$w_buff1~0_In1399591859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1399591859, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1399591859|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1399591859, ~weak$$choice2~0=~weak$$choice2~0_In1399591859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1399591859} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1399591859, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1399591859|, ~x$w_buff1~0=~x$w_buff1~0_In1399591859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1399591859, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1399591859|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1399591859, ~weak$$choice2~0=~weak$$choice2~0_In1399591859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1399591859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:48:32,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L851-->L851-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1165980548 256)))) (or (and (= ~x$w_buff0_used~0_In-1165980548 |ULTIMATE.start_main_#t~ite42_Out-1165980548|) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In-1165980548| |ULTIMATE.start_main_#t~ite41_Out-1165980548|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1165980548 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In-1165980548 256)) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1165980548 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1165980548 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1165980548| |ULTIMATE.start_main_#t~ite41_Out-1165980548|) (= ~x$w_buff0_used~0_In-1165980548 |ULTIMATE.start_main_#t~ite41_Out-1165980548|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1165980548, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-1165980548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1165980548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1165980548, ~weak$$choice2~0=~weak$$choice2~0_In-1165980548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165980548} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1165980548, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1165980548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1165980548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1165980548, ~weak$$choice2~0=~weak$$choice2~0_In-1165980548, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1165980548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165980548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:48:32,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L853-->L854: Formula: (and (= v_~x$r_buff0_thd0~0_126 v_~x$r_buff0_thd0~0_125) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} 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-27 16:48:32,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L854-->L854-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In577757036 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out577757036| |ULTIMATE.start_main_#t~ite50_Out577757036|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In577757036 256)))) (or (= (mod ~x$w_buff0_used~0_In577757036 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In577757036 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In577757036 256)) .cse1))) (= ~x$r_buff1_thd0~0_In577757036 |ULTIMATE.start_main_#t~ite50_Out577757036|)) (and (= |ULTIMATE.start_main_#t~ite50_In577757036| |ULTIMATE.start_main_#t~ite50_Out577757036|) (= ~x$r_buff1_thd0~0_In577757036 |ULTIMATE.start_main_#t~ite51_Out577757036|) (not .cse0)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In577757036|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In577757036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In577757036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In577757036, ~weak$$choice2~0=~weak$$choice2~0_In577757036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In577757036} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out577757036|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In577757036, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out577757036|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In577757036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In577757036, ~weak$$choice2~0=~weak$$choice2~0_In577757036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In577757036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:48:32,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L856-->L859-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_14 v_~x~0_125) (not (= 0 (mod v_~x$flush_delayed~0_29 256))) (= v_~x$flush_delayed~0_28 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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-27 16:48:32,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L859-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 16:48:32,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:32 BasicIcfg [2019-12-27 16:48:32,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:32,650 INFO L168 Benchmark]: Toolchain (without parser) took 74476.55 ms. Allocated memory was 144.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.8 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:32,651 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.2 MB. Free memory is still 120.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:48:32,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.95 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 154.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:32,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.11 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:32,654 INFO L168 Benchmark]: Boogie Preprocessor took 42.42 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:32,657 INFO L168 Benchmark]: RCFGBuilder took 812.74 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 98.1 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:32,657 INFO L168 Benchmark]: TraceAbstraction took 72791.09 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:32,661 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.18 ms. Allocated memory is still 144.2 MB. Free memory is still 120.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.95 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 154.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.11 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.42 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.74 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 98.1 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72791.09 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 92 ProgramPointsAfterwards, 216 TransitionsBefore, 99 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 34 ChoiceCompositions, 6446 VarBasedMoverChecksPositive, 230 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 82137 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L829] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 2 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L831] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] 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) [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 b = 1 [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 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 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L743] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L743] 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) [L744] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 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 [L746] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L837] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L837] 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) [L838] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L841] 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 [L844] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L845] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L846] 0 x$flush_delayed = weak$$choice2 [L847] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L848] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L848] 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) [L849] 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)) [L850] 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)) [L851] 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)) [L852] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L852] 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)) [L854] 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)) [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1975 SDtfs, 3673 SDslu, 6707 SDs, 0 SdLazy, 5127 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 45 SyntacticMatches, 36 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3520 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147565occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 50984 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 593 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 175389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...